Search (2 results, page 1 of 1)
-
×
author_ss:"Herrera-Viedma, E."
-
×
language_ss:"e"
-
×
theme_ss:"Retrievalalgorithmen"
-
×
year_i:[2000 TO 2010}
- Did you mean:
- author's%3a%22Tombros%2c A.%22 2
- authors%3a%22Tombros%2c A.%22 2
-
Herrera-Viedma, E.; Cordón, O.; Herrera, J.C.; Luqe, M.: ¬An IRS based on multi-granular lnguistic information (2003)
0.00
0.0026849252 = product of: 0.0053698504 = sum of: 0.0053698504 = product of: 0.010739701 = sum of: 0.010739701 = weight(_text_:a in 2740) [ClassicSimilarity], result of: 0.010739701 = score(doc=2740,freq=14.0), product of: 0.053105544 = queryWeight, product of: 1.153047 = idf(docFreq=37942, maxDocs=44218) 0.046056706 = queryNorm 0.20223314 = fieldWeight in 2740, product of: 3.7416575 = tf(freq=14.0), with freq of: 14.0 = termFreq=14.0 1.153047 = idf(docFreq=37942, maxDocs=44218) 0.046875 = fieldNorm(doc=2740) 0.5 = coord(1/2) 0.5 = coord(1/2)
- Abstract
- An information retrieval system (IRS) based on fuzzy multi-granular linguistic information is proposed. The system has an evaluation method to process multi-granular linguistic information, in such a way that the inputs to the IRS are represented in a different linguistic domain than the outputs. The system accepts Boolean queries whose terms are weighted by means of the ordinal linguistic values represented by the linguistic variable "Importance" assessed an a label set S. The system evaluates the weighted queries according to a threshold semantic and obtains the linguistic retrieval status values (RSV) of documents represented by a linguistic variable "Relevance" expressed in a different label set S'. The advantage of this linguistic IRS with respect to others is that the use of the multi-granular linguistic information facilitates and improves the IRS-user interaction
- Type
- a
-
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
0.0023678814 = product of: 0.0047357627 = sum of: 0.0047357627 = product of: 0.009471525 = sum of: 0.009471525 = weight(_text_:a in 1751) [ClassicSimilarity], result of: 0.009471525 = score(doc=1751,freq=8.0), product of: 0.053105544 = queryWeight, product of: 1.153047 = idf(docFreq=37942, maxDocs=44218) 0.046056706 = queryNorm 0.17835285 = fieldWeight in 1751, product of: 2.828427 = tf(freq=8.0), with freq of: 8.0 = termFreq=8.0 1.153047 = idf(docFreq=37942, maxDocs=44218) 0.0546875 = fieldNorm(doc=1751) 0.5 = coord(1/2) 0.5 = coord(1/2)
- 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).
- Type
- a