publication . Preprint . 2011

Improving Ranking Using Quantum Probability

Melucci, Massimo;
Open Access English
  • Published: 27 Aug 2011
Abstract
The paper shows that ranking information units by quantum probability differs from ranking them by classical probability provided the same data used for parameter estimation. As probability of detection (also known as recall or power) and probability of false alarm (also known as fallout or size) measure the quality of ranking, we point out and show that ranking by quantum probability yields higher probability of detection than ranking by classical probability provided a given probability of false alarm and the same parameter estimation data. As quantum probability provided more effective detectors than classical probability within other domains that data manage...
Subjects
free text keywords: Computer Science - Information Retrieval, Computer Science - Emerging Technologies, Computer Science - Learning, Physics - Data Analysis, Statistics and Probability
Download from
25 references, page 1 of 2

[1] L. Accardi. On the probabilistic roots of the quantum mechanical paradoxes. In S. Diner and L. de Broglie, editors, The wave-particle dualism, pages 297-330. D. Reidel pub. co., 1984.

[2] L. Accardi. Urne e camaleonti. Il Saggiatore, 1997. In Italian.

[3] L. Accardi and A. Fedullo. On the statistical meaning of complex numbers in quantum mechanics. Lettere al nuovo cimento, 34(7):161-172, June 1982. [OpenAIRE]

[4] G. Boole. An investigation of the laws of thought. Walton and Maberly, 1854.

[5] P. Bruza, D. Sofge, W.F. Lawless, C.J. van Rijsbergen, and M. Klusch, editors. Quantum Interaction, volume 5494 of Lecture Notes in Computer Science, Saarbru¨cken, Germany, 2009. Springer.

[6] G. Cariolaro and G. Pierobon. Performance of quantum data transmission systems in the presence of thermal noise. IEEE Transactions on Communications, 58:623-630, February 2010.

[7] W.B. Croft, D. Metzler, and T. Strohman. Search Engines: Information Retrieval in Practice. Addison Wesley, 2009.

[8] N. Dalvi, C. R´e, and D. Suciu. Probabilistic databases: diamonds in the dirt. Communications of the ACM, 52:86-94, July 2009.

[9] R. B. Griffiths. Consistent quantum theory. Cambridge University Press, 2002.

[10] P.R. Halmos. Finite-dimensional vector spaces. Undergraduate Texts in Mathematics. Springer, 1987.

[11] C. W. Helstrom. Quantum detection and estimation theory. Academic Press, 1976.

[12] R.I.G. Hughes. The structure and interpretation of quantum mechanics. Harvard University Press, 1989.

[13] A.N. Kolmogorov. Foundations of the theory of probability. Chelsea Publishing Company, New York, second edition, 1956.

[14] M. Melucci. A basis for information retrieval in context. ACM Transactions on Information Systems, 26(3), 2008. [OpenAIRE]

[15] J. Neyman and E.S. Pearson. On the problem of the most efficient tests of statistical hypotheses. Philosophical Transactions of the Royal Society, Series A, 231:289-337, 1933. [OpenAIRE]

25 references, page 1 of 2
Powered by OpenAIRE Open Research Graph
Any information missing or wrong?Report an Issue