arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1809.04052cs.DScs.IR
收藏

概率分布的极大相合抽样与Jaccard指数

Maximally Consistent Sampling and the Jaccard Index of Probability Distributions

Ryan Moulton, Yunjiang Jiang

摘要:

我们介绍简单,有效的算法计算MinHash的概率分布,适用于稀疏和密集的数据,与同等的运行时间,以最先进的两种情况。这些算法的碰撞概率是一个新的措施的相似性的积极的向量,我们详细调查。我们描述的意义上,这种碰撞概率是最佳的任何局部敏感的哈希采样的基础上。我们认为,这种相似性度量是更有用的概率分布比其他算法追求加权MinHash的相似性,是自然的推广Jaccard指数。

英文摘要:

We introduce simple, efficient algorithms for computing a MinHash of a probability distribution, suitable for both sparse and dense data, with equivalent running times to the state of the art for both cases. The collision probability of these algorithms is a new measure of the similarity of positive vectors which we investigate in detail. We describe the sense in which this collision probability is optimal for any Locality Sensitive Hash based on sampling. We argue that this similarity measure is more useful for probability distributions than the similarity pursued by other algorithms for weighted MinHash, and is the natural generalization of the Jaccard index.

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

↑