Search (2 results, page 1 of 1)
- Did you mean:
- rvk_ss%3a%2200 75400 allgemeines %2f buch- und bibliothekswesen%2c informationswissenschaft %2f bibliothekswesen %2f sacherschlie%c3%9fung in bibliotheken %2f schlagwortregeln%2c schlagwortverzeichnis%22 2
- rvk_ss%3a%2200 75000 allgemeines %2f buch- und bibliothekswesen%2c informationswissenschaft %2f bibliothekswesen %2f sacherschlie%c3%9fung in bibliotheken %2f schlagwortregeln%2c schlagwortverzeichnis%22 2
- rvk_ss%3a%2200 75400 allgemeinen %2f buch- und bibliothekswesen%2c informationswissenschaft %2f bibliothekswesen %2f sacherschlie%c3%9fung in bibliotheken %2f schlagwortregeln%2c schlagwortverzeichnis%22 2
- rvk_ss%3a%2200 75400 allgemeines %2f buch- und bibliothekswesen%2c informationswissenschaft %2f bibliothekswesen %2f sacherschlie%c3%9fung in bibliotheken %2f schlagwortregeln%2c sschlagwortverzeichnis%22 2
- rvk_ss%3a%2223 75400 allgemeines %2f buch- und bibliothekswesen%2c informationswissenschaft %2f bibliothekswesen %2f sacherschlie%c3%9fung in bibliotheken %2f schlagwortregeln%2c schlagwortverzeichnis%22 2
-
Herrera-Viedma, E.; Cordón, O.; Herrera, J.C.; Luqe, M.: ¬An IRS based on multi-granular lnguistic information (2003)
0.00
4.0280976E-4 = product of: 0.0068477658 = sum of: 0.0068477658 = weight(_text_:in in 2740) [ClassicSimilarity], result of: 0.0068477658 = score(doc=2740,freq=10.0), product of: 0.033961542 = queryWeight, product of: 1.3602545 = idf(docFreq=30841, maxDocs=44218) 0.024967048 = queryNorm 0.20163295 = fieldWeight in 2740, product of: 3.1622777 = tf(freq=10.0), with freq of: 10.0 = termFreq=10.0 1.3602545 = idf(docFreq=30841, maxDocs=44218) 0.046875 = fieldNorm(doc=2740) 0.05882353 = coord(1/17)
- 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
- Series
- Advances in knowledge organization; vol.8
- Source
- Challenges in knowledge representation and organization for the 21st century: Integration of knowledge across boundaries. Proceedings of the 7th ISKO International Conference Granada, Spain, July 10-13, 2002. Ed.: M. López-Huertas
-
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.640176E-4 = product of: 0.006188299 = sum of: 0.006188299 = weight(_text_:in in 1751) [ClassicSimilarity], result of: 0.006188299 = score(doc=1751,freq=6.0), product of: 0.033961542 = queryWeight, product of: 1.3602545 = idf(docFreq=30841, maxDocs=44218) 0.024967048 = queryNorm 0.1822149 = fieldWeight in 1751, product of: 2.4494898 = tf(freq=6.0), with freq of: 6.0 = termFreq=6.0 1.3602545 = idf(docFreq=30841, maxDocs=44218) 0.0546875 = fieldNorm(doc=1751) 0.05882353 = coord(1/17)
- 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).