Publicación: Structure of morphologically expanded queries : a genetic algorithm approach
Archivos
Fecha
2009-10-13
Editor/a
Director/a
Tutor/a
Coordinador/a
Prologuista
Revisor/a
Ilustrador/a
Derechos de acceso
info:eu-repo/semantics/openAccess
Licencia Creative Commons
https://creativecommons.org/licenses/by-nc-nd/4.0/deed.es
Título de la revista
ISSN de la revista
Título del volumen
Editor
Elsevier
Resumen
In this paper we deal with two issues. First, we discuss the negative effects of term correlation in query expansion algorithms, and we propose a novel and simple method (query clauses) to represent expanded queries which may alleviate some of these negative effects. Second, we discuss a method to optimize local query-expansion methods using genetic algorithms, and we apply this method to improve stemming. We evaluate this method with the novel query representation method and show very significant improvements for the problem of stemming optimization.
Descripción
Categorías UNESCO
Palabras clave
information retrieval, query reformulation, genetic algorithms
Citación
Centro
E.T.S. de Ingeniería Informática
Departamento
Lenguajes y Sistemas Informáticos