Multiple query evaluation based on an enchanced genetic algorithm - Université Toulouse III - Paul Sabatier - Toulouse INP Accéder directement au contenu
Article Dans Une Revue Information Processing and Management Année : 2003

Multiple query evaluation based on an enchanced genetic algorithm

Résumé

Recent studies suggest that significant improvement in information retrieval performance can be achieved by combining multiple representations of an information need. The paper presents a genetic approach that combines the results from multiple query evaluations. The genetic algorithm aims to optimise the overall relevance estimate by exploring different directions of the document space. We investigate ways to improve the effectiveness of the genetic exploration by combining appropriate techniques and heuristics known in genetic theory or in the IR field. Indeed, the approach uses a niching technique to solve the relevance multimodality problem, a relevance feedback technique to perform genetic transformations on query formulations and evolution heuristics in order to improve the convergence conditions of the genetic process.The effectiveness of the global approach is demonstrated by comparing the retrieval results obtained by both genetic multiple query evaluation and classical single query evaluation performed on a subset of TREC-4 using the Mercure IRS. Moreover, experimental results show the positive effect of the various techniques integrated to our genetic algorithm model.
Fichier principal
Vignette du fichier
IPM_2003.pdf (129.41 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00359526 , version 1 (08-02-2009)

Identifiants

Citer

Lynda Tamine, Claude Chrisment, Mohand Boughanem. Multiple query evaluation based on an enchanced genetic algorithm. Information Processing and Management, 2003, 39 (2), pp.215-231. ⟨10.1016/S0306-4573(02)00048-1⟩. ⟨hal-00359526⟩
122 Consultations
152 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More