Towards scaling fully personalized pagerank

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3243, Issue , 2004, Pages 105-117

  Fogaras, Daniel ^a,b   Rácz, Balázs ^a,b  

^a INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

^b BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

WEBSITES;

ERROR PROBABILITIES; ESTIMATION APPROACHES; LOWER BOUNDS; NOVEL ALGORITHM; PAGE QUALITY; PAGE SELECTION; PERSONALIZATIONS; PERSONALIZED PAGERANK;

DATABASE SYSTEMS;

EID: 35048902592     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30216-2_9     Document Type: Article

References (26)

1. Z. Bar-Yossef, A. Berg, S. Chien, J. Fakcharoenphol, and D. Weitz. Approximating aggregate queries about web pages via random walks. In Proceedings of the 26th International Conference on Very Large Data Bases, pages 535-544. Morgan Kaufmann Publishers Inc., 2000.
2. Z. Bar-Yossef, A. Z. Broder, R. Kumar, and A. Tomkins. Sic transit gloria telae: towards an understanding of the web's decay. In Proceedings of the 13th World Wide Web Conference (WWW), pages 328-337. ACM Press, 2004.
3. P. Boldi and S. Vigna. The webgraph framework I: compression techniques. In Proceedings of the 13th World Wide Web Conference (WWW), pages 595-602. ACM Press, 2004.
4. A. Borodin, G. O. Roberts, J. S. Rosenthal, and P. Tsaparas. Finding authorities and hubs from link structures on the world wide web. In 10th International World Wide Web Conference, pages 415-429, 2001.
5. S. Brin and L. Page. The anatomy of a large-scale hypertextual Web search engine. Computer Networks and ISDN Systems, 30(1-7):107-117, 1998.
6. A. Z. Broder. On the resemblance and containment of documents. In Proceedings of the Compression and Complexity of Sequences (SEQUENCES'97), pages 21-29. IEEE Computer Society, 1997.
7. Y.-Y. Chen, Q. Can, and T. Suel. I/O-efHcient techniques for computing PageRank. In Proceedings of the eleventh international conference on Information and knowledge management, pages 549-557. ACM Press, 2002.
8. E. Cohen. Size-estimation framework with applications to transitive closure and reachability. J. Comput. Syst. Sci., 55(3):441-453, 1997.
9. N. Eiron and K. S. McCurley. Locality, hierarchy, and bidirectionality in the web. In Second Workshop on Algorithms and Models for the Web-Graph (WAW 2003), 2003.
10. D. Fogaras. Where to start browsing the web? In 3rd International Workshop on Innovative Internet Community Systems I2CS, published as LNCS 2877/2003, pages 65-79, 2003.
11. D. Fogaras and B. Rácz. A scalable randomized method to compute link-based similarity rank on the web graph. In Proceedings of the Clustering Information over the Web workshop, Conference on Extending Database Technology, 2004. http://www.ilab.sztaki.hu/websearch /Publications/index.html.
12. P.Google, http://labs.google.com/personalized.
13. T. H. Haveliwala. Topic-sensitive PageRank. In Proceedings of the 11th World Wide Web Conference (WWW), Honolulu, Hawaii, 2002.
14. T. H. Haveliwala, S. Kamvar, and G. Jeh. An analytical comparison of approaches to personalizing PageRank. Technical report, Stanford University, 2003.
15. M. R. Henzinger, A. Heydon, M. Mitzenmacher, and M. Najork. Measuring index quality using random walks on the Web. In Proceedings of the 8th World Wide Web Conference, Toronto, Canada, pages 213-225, 1999.
16. M. R. Henzinger, A. Heydon, M. Mitzenmacher, and M. Najork. On near-uniform url sampling. In Proceedings of the 9th international World Wide Web conference on Computer networks, pages 295-308, 2000.
17. M. R. Henzinger, P. Raghavan, and S. Rajagopalan. Computing on data streams. External memory algorithms, pages 107-118, 1999.
18. G. Jeh and J. Widom. Scaling personalized web search. In Proceedings of the 12th World Wide Web Conference (WWW), pages 271-279. ACM Press, 2003.
19. S. Kamvar, T. H. Haveliwala, C. Manning, and G. Golub. Exploiting the block structure of the web for computing PageRank. Technical report, Stanford University, 2003.
20. J. Kleinberg. Authoritative sources in a hyperlinked environment. Journal of the ACM, 46(5):604-632, 1999.
21. E. Kushilevitz and N. Nisan. Communication complexity. Cambridge University Press, 1997.
22. R. Lempel and S. Moran. Rank stability and rank similarity of link-based web ranking algorithms in authority connected graphs. In Second Workshop on Algorithms and Models for the Web-Graph (WAW 2003), 2003.
23. L. Page, S. Brin, R. Motwani, and T. Winograd. The PageRank citation ranking: Bringing order to the web. Technical report, Stanford Digital Library Technologies Project, 1998.
24. C. R. Palmer, P. B. Gibbons, and C. Faloutsos. ANF: a fast and scalable tool for data mining in massive graphs. In Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 81-90. ACM Press, 2002.
25. M. Richardson and P. Domingos. The Intelligent Surfer: Probabilistic combination of link and content information in PageRank. Advances in Neural Information Processing Systems, 14:1441-1448, 2002.
26. P. Rusmevichientong, D. M. Pennock, S. Lawrence, and C. L. Giles. Methods for sampling pages uniformly from the world wide web. In AAAI Fall Symposium on Using Uncertainty Within Computation, pages 121-128, 2001.