arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1008.3775cs.NI
收藏

Top-k个性化PageRank列表的Monte Carlo方法及名字消歧

Monte Carlo Methods for Top-k Personalized PageRank Lists and Name Disambiguation

Konstantin Avrachenkov, Nelly Litvak, Danil A. Nemirovsky, Elena Smirnova, Marina Sokol

摘要:

我们研究了top-k个性化PageRank列表的快速检测问题。这个问题有许多重要的应用,如寻找大型图中的局部切割,估计相似距离和名称消歧。特别是,我们将我们的研究结果构建有效的算法的人名消歧问题。我们认为,当找到top-k个性化PageRank列表两个观察是重要的。首先,快速检测节点的前k个最重要的邻居是至关重要的,而前k个列表中的确切顺序以及PageRank的确切值到目前为止并不那么重要。其次,top-k列表中的少量错误元素不会真正降低top-k列表的质量,但它可以导致显着的计算节省。基于这两个关键的观察,我们提出了快速检测前k个个性化PageRank列表的蒙特卡罗方法。我们提供了所提出的方法和供应停止标准的性能评估。然后,我们将这些方法应用到人名消歧问题中。所开发的人名消歧算法在WePS 2010竞赛中获得第二名。

英文摘要:

We study a problem of quick detection of top-k Personalized PageRank lists. This problem has a number of important applications such as finding local cuts in large graphs, estimation of similarity distance and name disambiguation. In particular, we apply our results to construct efficient algorithms for the person name disambiguation problem. We argue that when finding top-k Personalized PageRank lists two observations are important. Firstly, it is crucial that we detect fast the top-k most important neighbours of a node, while the exact order in the top-k list as well as the exact values of PageRank are by far not so crucial. Secondly, a little number of wrong elements in top-k lists do not really degrade the quality of top-k lists, but it can lead to significant computational saving. Based on these two key observations we propose Monte Carlo methods for fast detection of top-k Personalized PageRank lists. We provide performance evaluation of the proposed methods and supply stopping criteria. Then, we apply the methods to the person name disambiguation problem. The developed algorithm for the person name disambiguation problem has achieved the second place in the WePS 2010 competition.

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

↑