Fast incremental and personalized PageRank

Proceedings of the VLDB Endowment

Volumn 4, Issue 3, 2010, Pages 173-184

  Bahmani, Bahman ^a   Chowdhury, Abdur ^b   Goel, Ashish ^a  

^a STANFORD UNIVERSITY   (United States)

^b TWITTER INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ITERATIVE METHODS; MEMORY ARCHITECTURE; RANDOM PROCESSES; SOCIAL NETWORKING (ONLINE);

DISTRIBUTED SHARED MEMORY; DYNAMIC SOCIAL NETWORKS; INCREMENTAL COMPUTATION; ITERATION METHOD; NETWORK DATABASE; PERSONALIZED PAGERANK; RANDOM WALK; SOCIAL NETWORKING SITES;

MONTE CARLO METHODS;

EID: 79960170113     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/1929861.1929864     Document Type: Article

References (32)

1. A. Altman and M. Tennenholtz. Ranking systems: the PageRank axioms. In Proceedings of the 6th ACM conference on Electronic commerce, pages 1-8, 2005.
2. K. Avrachenkov, N. Litvak, D. Nemirovsky, and N. Osipova. Monte carlo methods in PageRank computation: When one iteration is sufficient. SIAM J. Numer. Anal., 45(2):890-904, 2007.
3. B. Bahmani, A. Chowdhury, and A. Goel. Fast incremental and personalized PageRank, http://arxiv.org/abs/1006.2880, 2010.
4. A.-L. Barabási and R. Albert. Emergence of scaling in random networks. Science, 286(5439):509-512, 1999.
5. P. Berkhin. Survey: A survey on PageRank computing. Internet Mathematics, 2(1), 2005.
6. A. Borodin, G. O. Roberts, J. S. Rosenthal, and P. Tsaparas. Link analysis ranking: algorithms, theory, and experiments. ACM Trans. Internet Technol., 5(1):231-297, 2005.
7. M. Brand. Fast online SVD revisions for lightweight recommender systems. In SDM, 2003.
8. S. Chien, C. Dwork, S. Kumar, and D. Sivakumar. Towards exploiting link evolution, 2001.
9. A. S. Das, M. Datar, A. Garg, and S. Rajaram. Google news personalization: scalable online collaborative filtering. In Proceedings of the 16th international conference on World Wide Web, pages 271-280, 2007.
10. A. Das Sarma, S. Gollapudi, and R. Panigrahy. Estimating PageRank on graph streams. In Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pages 69-78, 2008.
11. 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.
12. R. A. Hanneman and M. Riddle. Introduction to social network methods, chapter 10. published in digital form at http://faculty.ucr.edu/ hanneman/, 2005.
13. T. H. Haveliwala. Topic-sensitive PageRank. In WWW, pages 517-526, 2002.
14. G. Jeh and J. Widom. Scaling personalized web search. In WWW, pages 271-279, 2003.
15. S. Kamvar, T. Haveliwala, C. Manning, and G. Golub. Exploiting the block structure of the web for computing PageRank. Technical report, Stanford University, 2003.
16. S. D. Kamvar, T. H. Haveliwala, C. D. Manning, and G. H. Golub. Extrapolation methods for accelerating PageRank computations. In WWW, pages 261-270, 2003.
17. J. M. Kleinberg. Authoritative sources in a hyperlinked environment. J. ACM, 46(5):604-632, 1999.
18. A. N. Langville and C. D. Meyer. Updating PageRank using the group inverse and stochastic complementation. Technical report, North Carolina State University, Mathematics Department, 2002.
19. A. N. Langville and C. D. Meyer. Updating the stationary vector of an irreducible markov chain. Technical report, North Carolina State University, Mathematics Department, 2002.
20. A. N. Langville and C. D. Meyer. Deeper inside PageRank. Internet Mathematics, 1:2004, 2004.
21. A. N. Langville and C. D. Meyer. Updating PageRank with iterative aggregation. In Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters, pages 392-393, 2004.
22. R. Lempel and S. Moran. SALSA: the stochastic approach for link-structure analysis. ACM Trans. Inf. Syst., 19(2):131-160, 2001.
23. D. Liben-Nowell and J. Kleinberg. The link prediction problem for social networks. In CIKM '03, pages 556-559, 2003.
24. N. Litvak, W. R. W. Scheinhardt, and Y. Volkovich. In-degree and PageRank: Why do they follow similar power laws? Internet Math., 4(2-3):175-198, 2007.
25. C. D. Manning, P. Raghavan, and H. Schutze. Introduction to Information Retrieval. Cambridge University Press, 2008.
26. F. McSherry. A uniform approach to accelerated PageRank computation. In Proceedings of the 14th international conference on World Wide Web, pages 575-582, 2005.
27. M. A. Najork. Comparing the effectiveness of HITS and SALSA. In CIKM, pages 157-164, 2007.
28. Netflix cinematch. http://www.netflix.com.
29. A. Y. Ng, A. X. Zheng, and M. I. Jordan. Stable algorithms for link analysis. In Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval, pages 258-266, 2001.
30. L. Page, S. Brin, R. Motwani, and T. Winograd. The PageRank citation ranking: Bringing order to the web. Technical report, Stanford InfoLab, 1999.
31. T. Sarlós, A. A. Benczúr, K. Csalogány, D. Fogaras, and B. Rácz. To randomize or not to randomize: space optimal summaries for hyperlink analysis. In WWW, pages 297-306, 2006.
32. H. Tong, S. Papadimitriou, P. S. Yu, and C. Faloutsos. Proximity tracking on time-evolving bipartite graphs. In SDM, pages 704-715, 2008.