arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1108.5491cs.IRcs.ETcs.LGphysics.data-an
收藏

使用量子概率改进排序

Improving Ranking Using Quantum Probability

University of Padua(帕多瓦大学)

Massimo Melucci

摘要:

本文表明,排序信息单位的量子概率不同,他们的经典概率提供了相同的数据用于参数估计。由于检测概率(也称为召回率或功率)和误报概率(也称为沉降物或大小)衡量排名的质量,我们指出,并表明,量子概率的排名产生更高的检测概率比经典概率的排名提供了一个给定的误报概率和相同的参数估计数据。由于量子概率在数据管理的其他领域提供了比经典概率更有效的检测器,我们推测,可以实现基于子空间的检测器的系统将比实现基于集合的检测器的系统更有效,有效性计算为在检测概率上估计的预期召回率和在虚警概率上估计的预期辐射。

英文摘要:

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 management, we conjecture that, the system that can implement subspace-based detectors shall be more effective than a system which implements a set-based detectors, the effectiveness being calculated as expected recall estimated over the probability of detection and expected fallout estimated over the probability of false alarm.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑