Search (1 results, page 1 of 1)

Did you mean:
author's%3a%20der%2c H. u. A. gunson %28Comp.%29%22 1
author's%3a%20der%2c H. u. A. gunton %28Comp.%29%22 1
authors%3a%20der%2c H. u. A. gunson %28Comp.%29%22 1
author's%3a%20der%2c H. u. A. gibson %28Comp.%29%22 1
authors%3a%20der%2c H. u. A. gunton %28Comp.%29%22 1

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.00
```
0.0016462277 = product of:
  0.009877366 = sum of:
    0.009877366 = weight(_text_:a in 638) [ClassicSimilarity], result of:
      0.009877366 = score(doc=638,freq=14.0), product of:
        0.041864127 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.03630739 = queryNorm
        0.23593865 = fieldWeight in 638, product of:
          3.7416575 = tf(freq=14.0), with freq of:
            14.0 = termFreq=14.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.0546875 = fieldNorm(doc=638)
  0.16666667 = coord(1/6)
```
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.

Type

a