López-Herrera, A.G.; Herrera-Viedma, E.; Herrera, F.: ¬A study of the use of multi-objective evolutionary algorithms to learn Boolean queries : a comparative study (2009)
0.00
3.255793E-4 = product of:
0.0048836893 = sum of:
0.0048836893 = product of:
0.009767379 = sum of:
0.009767379 = weight(_text_:information in 1751) [ClassicSimilarity], result of:
0.009767379 = score(doc=1751,freq=4.0), product of:
0.050870337 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.028978055 = queryNorm
0.1920054 = fieldWeight in 1751, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0546875 = fieldNorm(doc=1751)
0.5 = coord(1/2)
0.06666667 = coord(1/15)
- 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).
- Source
- Journal of the American Society for Information Science and Technology. 60(2009) no.6, S.1192-1207
