Local computation of pagerank contributions

Internet Mathematics

Volumn 5, Issue 1-2, 2008, Pages 23-45

  Andersen, Reid ^a   Borgs, Christian ^b   Chayes, Jennifer ^b   Hopcroft, John ^c   Mirrokni, Vahab ^d   Teng, Shang Hua ^e  

^a Microsoft Research New England ^*  (United States)

^b MICROSOFT RESEARCH   (United States)

^c Department of Computer Science and School of Operations Research and Information Engineering   (United States)

^d GOOGLE INC   (United States)

^e BOSTON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 77954581565     PISSN: 15427951     EISSN: None     Source Type: Journal    
DOI: 10.1080/15427951.2008.10129302     Document Type: Article

References (19)

1. R. Andersen, F. Chung, and K. Lang. “Local Graph Partitioning Using PageRank Vectors.” In Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, pp. 475–486. Washington, DC: IEEE Computer Society, 2006.
2. L. Becchetti, C. Castillo, D. Donato, S. Leonardi, and R. Baeza- Yates. “Link-Based Characterization and Detection of Web Spam.” Paper presented at Second International Workshop on Adversarial Information Retrieval on the Web (AIRWeb), Seattle, WA, August 10, 2006. Available at http://airweb.cse.lehigh.edu/ 2006/becchetti.pdf.
3. A. A. Benczúr, K. Csalogány, T. Sarlós, and M. Uher. “Spamrank: Fully Automatic Link Spam Detection.” Paper presented at First International Workshop on Adversarial Information Retrieval on theWeb (AIRWeb), Chiba, Japan, May 10–14, 2005. Available at http://airweb.cse.lehigh.edu/2005/benczur. pdf.
4. P. Berkhin. “Bookmark-Coloring Algorithm for Personalized PageRank Computing.” Internet Math. 3:1 (2006), 41–62.
5. S. Brin and L. Page. “The Anatomy of a Large-Scale Hypertextual Web Search Engine.” Computer Networks and ISDN Systems 30:1–7 (1998), 107–117.
6. Y. Chen, Q. Gan, and T. Suel. “Local Methods for Estimating Page- Rank Values.” In Proceedings of the Thirteenth ACM International Conference on Information and Knowledge Management, pp. 381–389. New York: ACM Press, 2004.
7. D. Fetterly, M. Manasse, and M. Najork. “Spam, Damn Spam, and Statistics: Using Statistical Analysis to Locate Spam Web Pages.” In Proceedings of the 7th International Workshop on the Web and Databases, pp. 1–6. New York: ACM Press, 2004.
8. D. Fogaras and B. Racz. “Towards Scaling Fully Personalized PageRank.” In Algorithms and Models for the Web-Graph: Third International Workshop, WAW 2004, Rome, Italy, October 16, 2004, Proceeedings, Lecture Notes in Computer Science 3243, pp. 105–117. Berlin: Springer, 2004.
9. Z. Gyöngyi, H. Garcia-Molina, and J. Pedersen. “Combating Web Spam with Trustrank.” In Proceedings of the Thirtieth International Conference on Very Large Data Bases, pp. 576–587. San Francisco: Morgan Kaufmann, 2004.
10. Z. Gyöngyi, P. Berkhin, H. Garcia-Molina, and J. Pedersen. “Link Spam Detection Based onMass Estimation.” In Proceedings of the 32nd International Conference on Very Large Databases, pp. 439–450. New York, ACM Press, 2006.
11. Z. Gyöngyi, H. Garcia-Molina, and J. Pedersen. “Web Content Categorization Using Link Information.” Technical report, Stanford University, 2006.
12. T. H. Haveliwala. “Topic-Sensitive PageRank: A Context-Sensitive Ranking Algorithm for Web Search.” IEEE Trans. Knowl. Data Eng. 15:4 (2003), 784–796.
13. 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.
14. V. Krishnan and R. Raj. “Web Spam Detection with Anti-trust Rank.” Paper presented at Second InternationalWorshop on Adversarial Information Retreival on the Web (AIRweb), Seattle, WA, August 10, 2006. Available at http:// airweb.cse.lehigh.edu/2006/krishnan.pdf.
15. G. Mishne, D. Carmel, and R. Lempel. “Blocking Blog Spam with Language Model Disagreement.” Paper presented at First International Workshop on Adversarial Information Retrieval on the Web (AIRWeb), Chiba, Japan, May 10–14, 2005. Available at http://airweb.cse.lehigh.edu/2005/mishne.pdf.
16. M. Naor and L. Stockmeyer. “What Can Be Computed Locally?” SIAM J. Comput. 24:6 (2005), 1259–1277.
17. A. Ntoulas, M. Najork, M. Manasse, and D. Fetterly. “Detecting SpamWeb Pages through Content Analysis.” In Proceedings of the 15th International Conference on World Wide Web, pp. 83–92. New York: ACM Press, 2006.
18. 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.
19. D. A. Spielman and S.-H. Teng. “Nearly-Linear Time Algorithms for Graph Partitioning, Graph Sparsification, and Solving Linear Systems.” In Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing, pp. 81–90. New York: ACM Press, 2004.