A study of the use of multi‐objective evolutionary algorithms to learn Boolean queries: A comparative study

A.G. López‐Herrera, E. Herrera‐Viedma and F. Herrera

Journal of the American Society for Information Science and Technology, 2009, vol. 60, issue 6, 1192-1207

Abstract: In this article, our interest is focused on the automatic learning of Boolean queries in information retrieval systems (IRSs) by means of multi‐objective evolutionary algorithms considering the classic performance criteria, precision and recall. We present a comparative study of four well‐known, general‐purpose, multi‐objective evolutionary algorithms to learn Boolean queries in IRSs. These evolutionary algorithms are the Nondominated Sorting Genetic Algorithm (NSGA‐II), the first version of the Strength Pareto Evolutionary Algorithm (SPEA), the second version of SPEA (SPEA2), and the Multi‐Objective Genetic Algorithm (MOGA).

Date: 2009
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/asi.21060

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:bla:jamist:v:60:y:2009:i:6:p:1192-1207

Ordering information: This journal article can be ordered from
https://doi.org/10.1002/(ISSN)1532-2890

Access Statistics for this article

More articles in Journal of the American Society for Information Science and Technology from Association for Information Science & Technology
Bibliographic data for series maintained by Wiley Content Delivery ().