A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf
.
Using the Quantum Probability Ranking Principle to Rank Interdependent Documents
[chapter]
2010
Lecture Notes in Computer Science
A known limitation of the Probability Ranking Principle (PRP) is that it does not cater for dependence between documents. Recently, the Quantum Probability Ranking Principle (QPRP) has been proposed, which implicitly captures dependencies between documents through "quantum interference". This paper explores whether this new ranking principle leads to improved performance for subtopic retrieval, where novelty and diversity is required. In a thorough empirical investigation, models based on the
doi:10.1007/978-3-642-12275-0_32
fatcat:kgfxatggevahla2tzab7hwpt4y