Approximating personalized PageRank with minimal use of web graph data

Internet Mathematics

Volumn 3, Issue 3, 2006, Pages 257-294

  Gleich, David ^a   Polito, Marzia ^b  

^a STANFORD UNIVERSITY   (United States)

^b ABInventio   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 80051481471     PISSN: 15427951     EISSN: None     Source Type: Journal    
DOI: 10.1080/15427951.2006.10129128     Document Type: Article

References (34)

1. S. Abiteboul, M. Preda, and G. Cobena. “Adaptive On-Line Page Importance Computation.” In Proceedings of the 12th International Conference on World Wide Web, pp. 280–290. New York: ACM Press, 2003.
2. R. Andersen and K. J. Lang. “Communities from Seed Sets.” In Proceedings of the 15th International Conference on World Wide Web, pp. 223–232. New York: ACM Press, 2006.
3. R. Andersen, F. Chung, and K. J. Lang. “Local Graph Partitioning Using PageRank Vectors.” In 47th Annual IEEE Symposium on Foundations of Computer Science, pp. 475–486. Los Alamitos, CA: IEEE Press, 2006.
4. A. Arasu, J. Novak, A. Tomkins, and J. Tomlin. “PageRank Computation and the Structure of the Web: Experiments and Algorithms.” In The 11th International Conference on World Wide Web Posters Proceedings. Available online (http://www2002.org/CDROM/poster/173.pdf), 2002.
5. M. Bender, S. Michel, P. Triantafillou, G. Weikum, and C. Zimmer. “MINERVA: Collaborative P2P Search.” In Proceedings of the 31st International Conference on Very Large Data Bases, pp. 1263–1266. New York: VLDB Endowment, 2005.
6. P. Berkhin. “A Survey on PageRank Computing.” Internet Mathematics 2:1 (2005), 73–120.
7. P. Berkhin. “Bookmark Coloring Approach to Personalized PageRank.” Internet Mathematics 3:1 (2006), 41–62.
8. M. Bianchini, M. Gori, and F. Scarselli. “Inside PageRank.” ACM Trans. Inter. Tech. 5:1 (2005), 92–128.
9. P. Boldi and S. Vigna. “The WebGraph Framework I: Compression Techniques.” In Proceedings of the 13th International Conference on World Wide Web, pp. 595–602. New York: ACM Press, 2004.
10. S. Brin and L. Page. “The Anatomy of a Large-Scale Hypertextual (Web) Search Engine.” Computer Networks 30 (1998), 107–117.
11. S. Chakrabarti, M. van den Berg, and B. Dom. “Focused Crawling: A New Approach to Topic-Specific Web Resource Discovery.” Proc. WWW8, Computer Networks 31:11–16 (1999), 1623–1640.
12. S. Chien, C. Dwork, R. Kumar, D.R. Simon, and D. Sivakumar. “Link Evolution: Analysis and Algorithms.” Internet Mathematics 1:3 (2004), 277–304.
13. J. Cho, H. García-Molina, and L. Page. “Efficient Crawling Through URL Ordering.” Proc. WWW7, Computer Networks 30:1–7 (1998), 161–172.
14. G. Flake, S. Lawrence, and C. Lee Giles. “Efficient Identification of Web Communities.” In Proceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 150–160. New York: ACM Press, 2000.
15. D. Fogaras, B. Rácz, K. Csalogány, and T. Sarlós. “Towards Scaling Fully Personalized PageRank.” In Algorithms and Models for the Web-Graph: Third International Workshop, WAW 2004, Rome, Italy, October 16, 2004, Proceedings, Lecture Notes in Computer Science 3243, pp. 105–117. Berlin: Springer Verlag, 2004.
16. T. Haveliwala. “Topic-Sensitive PageRank.” In Proceedings of the 11th International Conference on World Wide Web, pp. 517–526. New York: ACM Press, 2002.
17. G. Horton. “On the Multilevel Solution Algorithm for Markov Chains.” Technical Report NASA CR-201671 ICASE Report No. 97-17, NASA Langley Research Center, 1997.
18. G. Jeh and J. Widom. “Scaling Personalized Web Search.” In Proceedings of the 12th international conference on World Wide Web, pp. 271–279. New York: ACM Press, 2003.
19. Sepandar D. Kamvar. Sepandar D. Kamvar’s homepage. Data section includes Stanford and Stanford-Berkeley data sets. Available online (http://www.stanford.edu/∼sdkamvar/research.html), 2003.
20. S. Kamvar, T. Haveliwala, C. Manning, and G. Golub. “Exploiting the Block Structure of the Web for Computing PageRank.” Technical report, Stanford University, 2003.
21. S. D. Kamvar, T. H. Haveliwala, C. D. Manning, and G. H. Golub. “Extrapolation Methods for Accelerating PageRank Computations.” In Proceedings of the 12th International Conference on World Wide Web, pp. 261–270. New York: ACM Press, 2003.
22. J. Kemeny and J. L. Snell. Finite Markov Chains, Undergraduate Texts in Mathematics. New York: Springer Verlag, 1983.
23. J. M. Kleinberg. “Authoritative Sources in a Hyperlinked Environment.” Journal of the ACM 46:5 (1999), 604–632.
24. A. Langville and C. Meyer. “Updating PageRank with Iterative Aggregation.” In Proceedings of the 13th International World Wide Web Conference on Alternate Track Papers & Posters, pp. 392–393. New York: ACM Press, 2004.
25. Amy N. Langville and Carl D. Meyer. “Deeper Inside PageRank.” Internet Mathematics 1:3 (2004), 335–380.
26. Tim Mayer. “Our Blog is Growing Up—And So Has Our Index,” Yahoo! Search Blog. Available online (http://www.ysearchblog.com/archives/000172.html), 2005.
27. F. McSherry. “A Uniform Approach to Accelerated PageRank Computation.” In Proceedings of the 14th International Conference on World Wide Web, pp. 575–582. New York: ACM Press, 2005.
28. J. Pitkov, H. Schutze, T. Cass, R. Cooley, D. Turnbull, A. Edmonds, E. Adar, and T. Breuel. “Personalized Search.” Communications of the ACM 45:9 (2002), 50–55.
29. P. Reynolds and A. Vadhat. “Efficient Peer-to-Peer Keyword Searching.” In Middleware 2003: ACM/IFIP/USENIX International Middleware Conference, Rio de Janeiro, Brazil, June 16–20, 2003, Proceedings, Lecture Notes in Computer Science 2672, pp. 21–40. New York: Springer, 2003.
30. M. Richardson and P. Domingos. “The Intelligent Surfer: Probabilistic Combination of Link and Content Information in Page- Rank.” Advances in Neural Information Processing Systems 14. Available online (http://books.nips.cc/papers/files/nips14/AA57.pdf), 2001.
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 Proceedings of the 15th International Conference on World Wide Web, pp. 297–306. New York: ACM Press, 2006.
32. T. Suel, C. Mathur, J.-W. Wu, J. Zhang, A. Delis, M. Kharrazi, X. Long, and K. Shanmugasundaram. “ODISSEA: A Peer-to-Peer Architecture for Scalable Web Search and Information Retrival.” International Workshop on the Web and Databases (WebDB).
33. J. Teevan, S. T. Dumais, and E. Horvitz. “Personalizing Search via Automated Analysis of Interests and Activities.” In Proceedings of the 28th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 449–456. New York: ACM Press, 2005.
34. Sebastiano Vigna. “WebGraph.” Available online (http://webgraph.dsi.unimi.it/), 2006.