Using the quantum probability ranking principle to rank interdependent documents
Data(s) |
2010
|
---|---|
Resumo |
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 PRP, as well as other recently proposed ranking strategies for subtopic retrieval (i.e. Maximal Marginal Relevance (MMR) and Portfolio Theory(PT)), are compared against the QPRP. On the given task, it is shown that the QPRP outperforms these other ranking strategies. And unlike MMR and PT, one of the main advantages of the QPRP is that no parameter estimation/tuning is required; making the QPRP both simple and effective. This research demonstrates that the application of quantum theory to problems within information retrieval can lead to significant improvements. |
Formato |
application/pdf |
Identificador | |
Publicador |
Springer Berlin Heidelberg |
Relação |
http://eprints.qut.edu.au/69261/1/zuccon2010d.pdf DOI:10.1007/978-3-642-12275-0_32 Zuccon, Guido & Azzopardi, Leif (2010) Using the quantum probability ranking principle to rank interdependent documents. In Lecture Notes in Computer Science : Advances in Information Retrieval, Springer Berlin Heidelberg, Milton Keynes, UK, pp. 357-369. |
Direitos |
Copyright 2010 Springer-Verlag Berlin Heidelberg The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-12275-0_32 |
Fonte |
Institute for Future Environments; School of Information Systems; Science & Engineering Faculty |
Tipo |
Conference Paper |