Metraipolis › archive › dc_131da1471894

Probabilistic relevance model — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Probabilistic_relevance_model
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-07T21:44:45.558Z
SHA-256 of the archived text
d06e5ba8f642a68fe92a4bf44f93d7bc5f248fd734cd42aa3b19c09e8d3b4f76
Stable URL of this page
https://metraipolis.com/documento/dc_131da1471894

How to cite

Probabilistic relevance model — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Probabilistic_relevance_model (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_131da1471894 (Metraipolis archive dc_131da1471894, sha256 d06e5ba8f642a68fe92a4bf44f93d7bc5f248fd734cd42aa3b19c09e8d3b4f76)
BibTeX
@misc{dc131da1471894,
  title = {Probabilistic relevance model — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Probabilistic_relevance_model},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_131da1471894; sha256 d06e5ba8f642a68fe92a4bf44f93d7bc5f248fd734cd42aa3b19c09e8d3b4f76},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Probabilistic_relevance_model. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The probabilistic relevance model was devised by Stephen E. Robertson and Karen Spärck Jones as a framework for probabilistic models to come. It is a formalism of information retrieval useful to derive ranking functions used by search engines and web search engines in order to rank matching documents according to their relevance to a given search query. It is a theoretical model estimating the probability that a document dj is relevant to a query q. The model assumes that this probability of relevance depends on the query and document representations. Furthermore, it assumes that there is a portion of all documents that is preferred by the user as the answer set for query q. Such an ideal answer set is called R and should maximize the overall probability of relevance to that user. The prediction is that documents in this set R are relevant to the query, while documents not present in the set are non-relevant. s i m ( d j , q ) = P ( R | d → j ) P ( R ¯ | d → j ) {\displaystyle sim(d_{j},q)={\frac {P(R|{\vec {d}}_{j})}{P({\bar {R}}|{\vec {d}}_{j})}}}

Tema degli esploratori: statistica e scienza dei dati (deposito sistematico; ricerca «information retrieval»).
Fonte: Wikipedia in inglese, voce «Probabilistic relevance model» — https://en.wikipedia.org/wiki/Probabilistic_relevance_model
Wikidata Q3318133 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q3318133
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Probabilistic_relevance_model?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1250196097, consultata il 2026-10-07T21:19:08.659Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: a8736f4e76547c288506a4e761f09b82407ca13199fe72c78adf425be5508346