Nikolaos Nanas
Research Subjects
Nikolaos Nanas has a total of 24 co-authors. Here are the top co-authors by number of shared publications:
Anne De Roeck
Open University
8 shared publicationsManolis Vavalis
Centre for Research and Technology Thessaly, Volos, Greece
7 shared publicationsM-Dyaa Albakour
University of Essex
4 shared publicationsMaria Fasli
University of Essex
4 shared publications- Udo Kruschwitz
University of Regensburg, Regensburg, Germany
4 shared publications Anne de Roeck
The Open University
3 shared publications
Latest Publications
- 29 January 2013
- Published by University of Illinois Libraries in First Monday
- Vol. 18 (2)
Front-paging online newspapers
Online newspapers and magazines still find it difficult to let readers discover and just read news. A plethora of stories on the front (home) page, overuse of complex grids, vast navigation lists and advertising immaturity still prevail. This paper deals with the general methodologies, the specific mechanisms and the enabling technologies associated with the design and the developing of personalized electronic front pages. Three approaches are presented and their particular implementations are discussed and evaluated.
- 29 January 2013
- Published by University of Illinois Libraries in First Monday
- Vol. 18 (2)
Front-paging online newspapers
Online newspapers and magazines still find it difficult to let readers discover and just read news. A plethora of stories on the front (home) page, overuse of complex grids, vast navigation lists and advertising immaturity still prevail. This paper deals with the general methodologies, the specific mechanisms and the enabling technologies associated with the design and the developing of personalized electronic front pages. Three approaches are presented and their particular implementations are discussed and evaluated.
- 1 January 2012
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 517-521
Analysis of Query Reformulations in a Search Engine of a Local Web Site
- 1 January 2012
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 517-521
Analysis of Query Reformulations in a Search Engine of a Local Web Site
- 18 January 2011
- Published by IGI Global Scientific Publishing
Collective Information Filtering for Web Observatories
Collective Information Filtering for Web Observatories: 10.4018/978-1-61520-841-8.ch008: Web observatories are becoming a common on-line practice. Their role is to compile, organize and convey information that serves the needs of a thematically
- 18 January 2011
- Published by IGI Global Scientific Publishing
Collective Information Filtering for Web Observatories
Collective Information Filtering for Web Observatories: 10.4018/978-1-61520-841-8.ch008: Web observatories are becoming a common on-line practice. Their role is to compile, organize and convey information that serves the needs of a thematically
- 1 January 2011
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 213-224
Exploring Ant Colony Optimisation for Adaptive Interactive Search
- 1 January 2011
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 213-224
Exploring Ant Colony Optimisation for Adaptive Interactive Search
- 1 January 2011
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 41-60
Moving towards Adaptive Search in Digital Libraries
- 1 January 2011
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 41-60
Moving towards Adaptive Search in Digital Libraries
- 1 January 2011
- Published by Springer Nature
- p. 605-610
AutoEval: An Evaluation Methodology for Evaluating Query Suggestions Using Query Logs
- 1 January 2011
- Published by Springer Nature
- p. 605-610
AutoEval: An Evaluation Methodology for Evaluating Query Suggestions Using Query Logs
- 27 August 2010
- Published by Springer Nature in Swarm Intelligence
- Vol. 4 (4) , 275-300
Words, antibodies and their interactions
- 27 August 2010
- Published by Springer Nature in Swarm Intelligence
- Vol. 4 (4) , 275-300
Words, antibodies and their interactions
- Open Access
- 19 July 2010
- Published by Association for Computing Machinery (ACM)
- p. 202-209
A network-based model for high-dimensional information filtering
The Vector Space Model has been and to a great extent still is the de facto choice for profile representation in content-based Information Filtering. However, user profiles represented as weighted keyword vectors have inherent dimensionality problems. As the number of profile keywords increases, the vector representation becomes ambiguous, due to the exponential increase in the volume of the vector space and in the number of possible keyword combinations. We argue that the complexity and dynamics of Information Filtering require user profile representations which are resilient and resistant to this "curse of dimensionality". A user profile has to be able to incorporate many features and to adapt to a variety of interest changes. We propose an alternative, network-based profile representation that meets these challenging requirements. Experiments show that the network profile representation can more effectively capture additional information about a user's interests and thus achieve significant performance improvements over a vector-based representation comprising the same weighted keywords.
- 19 July 2010
- Published by Association for Computing Machinery (ACM)
- p. 202-209
Open AccessA network-based model for high-dimensional information filtering
The Vector Space Model has been and to a great extent still is the de facto choice for profile representation in content-based Information Filtering. However, user profiles represented as weighted keyword vectors have inherent dimensionality problems. As the number of profile keywords increases, the vector representation becomes ambiguous, due to the exponential increase in the volume of the vector space and in the number of possible keyword combinations. We argue that the complexity and dynamics of Information Filtering require user profile representations which are resilient and resistant to this "curse of dimensionality". A user profile has to be able to incorporate many features and to adapt to a variety of interest changes. We propose an alternative, network-based profile representation that meets these challenging requirements. Experiments show that the network profile representation can more effectively capture additional information about a user's interests and thus achieve significant performance improvements over a vector-based representation comprising the same weighted keywords.
- 1 July 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
Revisiting Evolutionary Information Filtering
Adaptive Information Filtering seeks a solution to the problem of information overload through a tailored representation of the user's interests, called user profile, which constantly adapts to changes in them. Evolutionary Algorithms have been proposed as a solution to the problem of profile adaptation, but the relevant attempts have not produced successful real world applications. In this paper, we argue that Adaptive Information Filtering is a complex and dynamic problem not easily addressed with Genetic Algorithms and Memetic Algorithms that adopt weighted keyword vector for profile representation. We discuss the theoretical issues and provide experimental evidence showing that such an approach suffers due to the large number of dimensions in the underlying vector space. The genetic operators cannot randomly produce the right combinations of keyword weights, given the very large number of possible combinations. With the current work, we wish to reanimate the interest in Evolutionary Information Filtering. Profile adaptation is a challenging problem with no established solution and biologically inspired solutions have still an important role to play in solving it. This however requires experimental methodologies that reflect the complexity and dynamics of the problem. This paper is part of ongoing research work in this direction.
- 1 July 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
Revisiting Evolutionary Information Filtering
Adaptive Information Filtering seeks a solution to the problem of information overload through a tailored representation of the user's interests, called user profile, which constantly adapts to changes in them. Evolutionary Algorithms have been proposed as a solution to the problem of profile adaptation, but the relevant attempts have not produced successful real world applications. In this paper, we argue that Adaptive Information Filtering is a complex and dynamic problem not easily addressed with Genetic Algorithms and Memetic Algorithms that adopt weighted keyword vector for profile representation. We discuss the theoretical issues and provide experimental evidence showing that such an approach suffers due to the large number of dimensions in the underlying vector space. The genetic operators cannot randomly produce the right combinations of keyword weights, given the very large number of possible combinations. With the current work, we wish to reanimate the interest in Evolutionary Information Filtering. Profile adaptation is a challenging problem with no established solution and biologically inspired solutions have still an important role to play in solving it. This however requires experimental methodologies that reflect the complexity and dynamics of the problem. This paper is part of ongoing research work in this direction.
- 1 May 2010
- Published by Elsevier in Information Processing & Management
- Vol. 46 (3) , 268-283
Personalised news and scientific literature aggregation
- 1 May 2010
- Published by Elsevier in Information Processing & Management
- Vol. 46 (3) , 268-283
Personalised news and scientific literature aggregation