Efficient personalized pagerank with accuracy assurance

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2012, Pages 15-23

  Fujiwara, Yasuhiro ^a   Nakatsuji, Makoto ^b   Yamamuro, Takeshi ^a   Shiokawa, Hiroaki ^a   Onizuka, Makoto ^a  

^a NTT Software Innovation Center   (Japan)

^b NTT CORPORATION   (Japan)

Author keywords

personalized pagerank; relevance computation

Indexed keywords

GRAPH MINING; ITERATIVE APPROACH; NON-ITERATIVE; ORDERS OF MAGNITUDE; PAGERANK; RANDOM SURFER MODELS; SPARSE MATRICES;

ITERATIVE METHODS;

DATA MINING;

EID: 84866039593     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2339530.2339538     Document Type: Conference Paper

References (39)

1. R. Andersen, F. R. K. Chung, and K. J. Lang. Local Graph Partitioning Using PageRank Vectors. In FOCS, pages 475-486, 2006.
2. K. Avrachenkov, V. Dobrynin, D. Nemirovsky, S. K. Pham, and E. Smirnova. PageRank Based Clustering of Hypertext Document Collections. In SIGIR, pages 873-874, 2008.
3. K. Avrachenkov, N. Litvak, D. Nemirovsky, E. Smirnova, and M. Sokol. Quick Detection of Top-k Personalized PageRank Lists. In WAW, pages 50-61, 2011.
4. B. Bahmani, A. Chowdhury, and A. Goel. Fast Incremental and Personalized PageRank. PVLDB, 4(3):173-184, 2010.
5. A. Balmin, V. Hristidis, and Y. Papakonstantinou. ObjectRank: Authority-based Keyword Search in Databases. In VLDB, pages 564-575, 2004.
6. D. M. Blei, A. Y. Ng, and M. I. Jordan. Latent Dirichlet Allocation. Journal of Machine Learning Research, 3:993-1022, 2003.
7. S. Chakrabarti, A. Pathak, and M. Gupta. Index Design and Query Processing for Graph Conductance Search. VLDB J., 20(3):445-470, 2011.
8. Y.-Y. Chen, Q. Gan, and T. Suel. Local Methods for Estimating PageRank Values. In CIKM, pages 381-389, 2004.
9. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. The MIT Press, 2009.
10. D. Fogaras, B. Rácz, K. Csalogány, and T. Sarlós. Towards Scaling Fully Personalized PageRank: Algorithms, Lower Bounds, and Experiments. Internet Mathematics, 2(3), 2005.
11. F. Fouss, A. Pirotte, J.-M. Renders, and M. Saerens. Random-walk Computation of Similarities Between Nodes of a Graph with Application to Collaborative Recommendation. IEEE Trans. Knowl. Data Eng., 19(3):355-369, 2007.
12. Y. Fujiwara, M. Nakatsuji, M. Onizuka, and M. Kitsuregawa. Fast and Exact Top-k Search for Random Walk with Restart. PVLDB, 5(5):442-453, 2012.
13. B. Gallagher, H. Tong, T. Eliassi-Rad, and C. Faloutsos. Using Ghost Edges for Classification in Sparsely Labeled Networks. In KDD, pages 256-264, 2008.
14. B. Gao, T.-Y. Liu, W. Wei, T. Wang, and H. Li. Semi-supervised Ranking on Very Large Graphs with Rich Metadata. In KDD, pages 96-104, 2011.
15. M. Gori and A. Pucci. Itemrank: A Random-walk Based Scoring Algorithm for Recommender Engines. In IJCAI, pages 2766-2771, 2007.
16. D. S. Gunderson. Handbook of Mathematical Induction: Theory and Applications. Chapman and Hall/CRC, 2010.
17. M. S. Gupta, A. Pathak, and S. Chakrabarti. Fast Algorithms for Top-k Personalized PageRank Queries. In WWW, pages 1225-1226, 2008.
18. A. Harpale, Y. Yang, S. Gopal, D. He, and Z. Yue. Citedata: a New Multi-faceted Dataset for Evaluating Personalized Search Performance. In CIKM, pages 549-558, 2010.
19. D. A. Harville. Matrix Algebra From a Statistician's Perspective. Springer, 2008.
20. J. L. Herlocker, J. A. Konstan, A. Borchers, and J. Riedl. An Algorithmic Framework for Performing Collaborative Filtering. In SIGIR, pages 230-237, 1999.
21. V. Hristidis, L. Raschid, and Y. Wu. Scalable Link-based Personalization for Ranking in Entity-relationship Graphs. In WebDB, 2011.
22. G. Jeh and J. Widom. SimRank: a Measure of Structural-context Similarity. In KDD, pages 538-543, 2002.
23. G. Jeh and J. Widom. Scaling Personalized Web Search. In WWW, pages 271-279, 2003.
24. G. Karypis, V. Kumar, and V. Kumar. Multilevel K-way Partitioning Scheme for Irregular Graphs. Journal of Parallel and Distributed Computing, 48:96-129, 1998.
25. D. Liben-Nowell and J. M. Kleinberg. The Link Prediction Problem for Social Networks. In CIKM, pages 556-559, 2003.
26. Q. Liu, E. Chen, H. Xiong, and C. H. Q. Ding. Exploiting User Interests for Collaborative Filtering: Interests Expansion via Personalized Ranking. In CIKM, pages 1697-1700, 2010.
27. F. McSherry. A Uniform Approach to Accelerated PageRank Computation. In WWW, pages 575-582, 2005.
28. G. Namata, S. Kok, and L. Getoor. Collective Graph Identification. In KDD, pages 87-95, 2011.
29. M. Newman, A.-L. Barabasi, and D. J. Watts. The Structure And Dynamics of Networks. Princeton University Press, 2006.
30. L. Page, S. Brin, R. Motwani, and T. Winograd. The PageRank Citation Ranking: Bringing Order to the Web. Technical Report 1999-66, Stanford InfoLab, November 1999.
31. W. H. Press, S. A. Teukolsky, W. T. Vetterling, and B. P. Flannery. Numerical Recipes 3rd Edition. Cambridge University Press, 2007.
32. E. Smirnova, K. Avrachenkov, and B. Trousse. Using Web Graph Structure for Person Name Disambiguation. In CLEF, 2010.
33. J. Sun, H. Qu, D. Chakrabarti, and C. Faloutsos. Neighborhood Formation and Anomaly Detection in Bipartite Graphs. In ICDM, pages 418-425, 2005.
34. H. Tong, C. Faloutsos, and J.-Y. Pan. Fast Random Walk with Restart and Its Applications. In ICDM, pages 613-622, 2006.
35. K. Voevodski, S.-H. Teng, and Y. Xia. Spectral Affinity in Protein Networks. BMC Systems Biology, 3(1):112, 2009.
36. S. White and P. Smyth. Algorithms for Estimating Relative Importance in Networks. In KDD, pages 266-275, 2003.
37. J. Yang and J. Leskovec. Patterns of Temporal Variation in Online Media. In WSDM, pages 177-186, 2011.
38. M. Yannakakis. Computing the Minimum Fill-in is NP-complete. SIAM. J. on Algebraic and Discrete Methods, 2(1):77-79, 1981.
39. D. Zhou, O. Bousquet, T. N. Lal, J. Weston, and B. Schölkopf. Learning with Local and Global Consistency. In NIPS, 2003.