Larson, R.R.: Information retrieval systems (2009)
0.06
0.05551693 = product of:
0.08327539 = sum of:
0.04025957 = weight(_text_:search in 3817) [ClassicSimilarity], result of:
0.04025957 = score(doc=3817,freq=2.0), product of:
0.1747324 = queryWeight, product of:
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.05027291 = queryNorm
0.230407 = fieldWeight in 3817, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.046875 = fieldNorm(doc=3817)
0.043015826 = product of:
0.08603165 = sum of:
0.08603165 = weight(_text_:engines in 3817) [ClassicSimilarity], result of:
0.08603165 = score(doc=3817,freq=2.0), product of:
0.25542772 = queryWeight, product of:
5.080822 = idf(docFreq=746, maxDocs=44218)
0.05027291 = queryNorm
0.33681408 = fieldWeight in 3817, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
5.080822 = idf(docFreq=746, maxDocs=44218)
0.046875 = fieldNorm(doc=3817)
0.5 = coord(1/2)
0.6666667 = coord(2/3)
- Abstract
- Information retrieval (IR) systems aim to select relevant material from large collections of information in response to user queries. The approaches used to accomplish this have been the focus of much research and development over the past 50 years, and have led to the algorithms underlying many commercial and Web-based search engines today. This entry describes the common components that go into the design of IR systems (from text processing to inverted file indexes). The major classes (or models) of retrieval algorithms (Boolean, vector, and probabilistic) are described along with formal definitions of the basic form of these algorithms and some of the variations in common use in IR research. In addition, the entry examines query expansion techniques, and in particular relevance feedback, and how they are used in IR systems.
