Dang, E.K.F.; Luk, R.W.P.; Allan, J.: ¬A retrieval model family based on the probability ranking principle for ad hoc retrieval (2022)
0.02
0.020766575 = product of:
0.06229972 = sum of:
0.06229972 = weight(_text_:retrieval in 638) [ClassicSimilarity], result of:
0.06229972 = score(doc=638,freq=8.0), product of:
0.1331496 = queryWeight, product of:
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.04401763 = queryNorm
0.46789268 = fieldWeight in 638, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.0546875 = fieldNorm(doc=638)
0.33333334 = coord(1/3)
- Abstract
- Many successful retrieval models are derived based on or conform to the probability ranking principle (PRP). We present a new derivation of a document ranking function given by the probability of relevance of a document, conforming to the PRP. Our formulation yields a family of retrieval models, called probabilistic binary relevance (PBR) models, with various instantiations obtained by different probability estimations. By extensive experiments on a range of TREC collections, improvement of the PBR models over some established baselines with statistical significance is observed, especially in the large Clueweb09 Cat-B collection.
