Publicación:
Structure of morphologically expanded queries : a genetic algorithm approach

Vista sencilla de ítem
dc.contributor.authorZaragoza, Hugo
dc.contributor.authorPérez Agüera, José R.
dc.contributor.authorPérez Iglesias, Joaquín
dc.contributor.authorAraujo Serna, M. Lourdes
dc.date.accessioned2024-05-21T13:03:37Z
dc.date.available2024-05-21T13:03:37Z
dc.date.issued2009-10-13
dc.description.abstractIn 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.es
dc.description.versionversión publicada
dc.identifier.doihttp://doi.org/10.1016/j.datak.2009.10.010
dc.identifier.issn0169-023X, ESSN: 1872-6933
dc.identifier.urihttps://hdl.handle.net/20.500.14468/19993
dc.language.isoen
dc.publisherElsevier
dc.relation.centerE.T.S. de Ingeniería Informática
dc.relation.departmentLenguajes y Sistemas Informáticos
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rights.urihttps://creativecommons.org/licenses/by-nc-nd/4.0/deed.es
dc.subject.keywordsinformation retrieval
dc.subject.keywordsquery reformulation
dc.subject.keywordsgenetic algorithms
dc.titleStructure of morphologically expanded queries : a genetic algorithm approaches
dc.typejournal article en
dc.typeartículoes
dspace.entity.typePublication
relation.isAuthorOfPublication77c4023e-4374-442a-9dfb-b9d4b609c31e
relation.isAuthorOfPublication.latestForDiscovery77c4023e-4374-442a-9dfb-b9d4b609c31e
Archivos
Bloque original
Mostrando 1 - 1 de 1
Miniatura
Nombre:
Documento.pdf
Tamaño:
568.88 KB
Formato:
Adobe Portable Document Format
Descargar
Colecciones
Artículos y papers