Fox, E.; Betrabet, S.; Koushik, M.; Lee, W.: Extended Boolean models (1992)
0.01
0.013419857 = product of:
0.04025957 = sum of:
0.04025957 = weight(_text_:search in 3512) [ClassicSimilarity], result of:
0.04025957 = score(doc=3512,freq=2.0), product of:
0.1747324 = queryWeight, product of:
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.05027291 = queryNorm
0.230407 = fieldWeight in 3512, 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=3512)
0.33333334 = coord(1/3)
- Abstract
- The classical interpretation of Boolean operators in an information retrieval system is in general too strict. A standard Boolean query rarely comes close to retrieving all and only those documents which are relevant to a query. Many models have been proposed with the aim of softening the interpretation of the Boolean operators in order to improve the precision and recall of the search results. This chapter discusses 3 such models: the Mixed Min and Max (MMM), the Paice, and the P-noem models. The MMM and Paice models are essentially variations of the classical fuzzy-set model, while the P-norm scheme is a distance-based approach. Our experimental results indicate that each of the above models provide better performance than the classical Boolean model in terms of retrieval effectiveness
