Structure of morphologically expanded queries: A genetic algorithm approach
Data & Knowledge Engineering (2010)
- ISSN: 0169023X
- DOI: 10.1016/j.datak.2009.10.010
Available from
hugo zaragoza's profile on Mendeley.
or
Abstract
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. Copyright &y& Elsevier
Author-supplied keywords
Sign up today - FREE
Mendeley saves you time finding and organizing research. Learn more
- All your research in one place
- Add and import papers easily
- Access it anywhere, anytime
Start using Mendeley in seconds!
Readership Statistics
5 Readers on Mendeley
by Discipline
by Academic Status
20% Student (Master)
20% Post Doc
20% Researcher (at a non-Academic Institution)
by Country
60% Spain
20% Italy
20% United States