Monte Carlo methods for top-k personalized PageRank lists and name disambiguation

Share/Save/Bookmark

Avrachenkov, Konstatin and Litvak, Nelly and Nemirovsky, Danil and Smirnova, Elena and Sokol, Marina (2010) Monte Carlo methods for top-k personalized PageRank lists and name disambiguation. [Report]

open access
[img]
Preview
PDF
310kB
Abstract: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.
Item Type:Report
Copyright:© 2010 INRIA
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/80246
Official URL:http://hal.inria.fr/inria-00510991
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page