Evolved term-weighting schemes in Information Retrieval: an analysis of the solution space

  • Authors:
  • Ronan Cummins;Colm O'Riordan

  • Affiliations:
  • Department of Information Technology, National University of Ireland, Galway, Ireland;Department of Information Technology, National University of Ireland, Galway, Ireland

  • Venue:
  • Artificial Intelligence Review
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Evolutionary computation techniques are increasingly being applied to problems within Information Retrieval (IR). Genetic programming (GP) has previously been used with some success to evolve term-weighting schemes in IR. However, one fundamental problem with the solutions generated by this stochastic, non-deterministic process, is that they are often difficult to analyse. In this paper, we introduce two different distance measures between the phenotypes (ranked lists) of the solutions (term-weighting schemes) returned by a GP process. Using these distance measures, we develop trees which show how different solutions are clustered in the solution space. We show, using this framework, that our evolved solutions lie in a different part of the solution space than two of the best benchmark term-weighting schemes available.