Local approximation of pagerank and reverse pagerank

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2008, Pages 279-288

  Bar Yossef, Ziv ^a,b   Mashiach, Li Tal ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b Google Inc   (Israel)

Author keywords

Local approximation; Lower bounds; Page rank; Reverse page rank

Indexed keywords

APPROXIMATION FACTOR; IN-DEGREE; LOCAL APPROXIMATION; LOCAL APPROXIMATION ALGORITHMS; LOCAL INFORMATION; LOWER BOUNDS; PAGE RANK; RANDOM WALK; REVERSE PAGE RANK; SEMANTIC RELATEDNESS; SOCIAL NETWORKS; TARGET NODES; WEB GRAPHS; WEB PAGE;

CONTROL THEORY; GRAPH THEORY; KNOWLEDGE MANAGEMENT; TAXONOMIES;

APPROXIMATION ALGORITHMS;

EID: 70349321258     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1458082.1458122     Document Type: Conference Paper

References (35)

1. Z. Bar-Yossef, R. Kumar, and D. Sivakumar. Sampling algorithms: Lower bounds and applications. In STOC, pages 266-275, 2001.
2. A. L. Barabasi and R. Albert. Emergence of scaling in random networks. Science, 286(5439):509-512, 1999.
3. P. Berkhin. A survey on PageRank computing. Internet Mathematics, 2(1):73-120, 2005.
4. K. Bharat, A. Broder, M. Henzinger, P. Kumar, and S. Venkatasubramanian. The connectivity server: Fast access to linkage information on the web. In 7th WWW, pages 469-477, 1998.
5. A. Z. Broder, R. Lempel, F. Maghoul, and J. O. Pedersen. Efficient PageRank approximation via graph aggregation. Inf. Retr., 9(2):123-138, 2006.
6. H. Buhrman and R. de Wolf. Complexity measures and decision tree complexity: a survey. Theoretical Comp. Sc., 288(1):21-43, 2002.
7. R. Canetti, G. Even, and O. Goldreich. Lower bounds for sampling algorithms for estimating the average. Information Processing Letters, 53:17-25, 1995.
8. S. Chakrabarti, M. van den Berg, and B. Dom. Focused crawling: a new approach to topic-specific Web resource discovery. Computer Networks, (11-16):1623-1640, 1999.
9. Y. Chen, Q. Gan, and T. Suel. Local methods for estimating PageRank values. In Proc. CIKM, pages 381-389, 2004.
10. J. Cho, H. Garcia-Molina, and L. Page. Efficient crawling through URL ordering. Computer Networks and ISDN Systems, 30(1-7):161-172, 1998.
11. A. Dasgupta, A. Ghosh, R. Kumar, C. Olston, S. Pandey, and A. Tomkins. The discoverability of the web. In Proc. 16th WWW, pages 421-430, 2007.
12. J. V. Davis and I. S. Dhillon. Estimating the global PageRank of Web communities. In Proc. 12th SIGKDD, pages 116-125, 2006.
13. J. Dean and M. R. Henzinger. Finding related pages in the World Wide Web. Computer Networks, 31(11-16):1467-1479, 1999.
14. S. Dill, R. Kumar, K. Mccurley, S. Rajagopalan, D. Sivakumar, and A. Tomkins. Self-similarity in the web. ACM Trans. Internet Techn., 2(3):205-223, 2002.
15. D. Fogaras. Where to start browsing the Web? In IICS, pages 65-79, 2003.
16. E. Gabrilovich and S. Markovitch. Computing semantic relatedness using wikipedia-based explicit semantic analysis. In Proc. 20th IJCAI, pages 250-257, 2007.
17. Z. Gyöngyi, H. Garcia-Molina, and J. Pedersen. Combating Web Spam with TrustRank. In VLDB, pages 576-587, 2004.
18. T. H. Haveliwala. Topic-sensitive PageRank: a context-sensitive ranking algorithm for web search. IEEE Trans. on Knowledge and Data Engineering, 15(4):784-796, 2003.
19. T. H. Haveliwala and S. D. Kamvar. The second eigenvalue of the Google matrix. Technical report, Stanford University, 2003.
20. A. Java, P. Kolari, T. Finin, and T. Oates. Modeling the spread of influence on the Blogosphere. Technical report, University of Maryland, Baltimore County, 2006.
21. G. Jeh and J. Widom. Scaling personalized Web search. In Proc. 12th WWW, pages 271-279, 2003.
22. S. Kamvar, H. Haveliwala, and G. Golub. Adaptive methods for the computation of PageRank. Linear Algebra and its Applications, 386:51-65, 2004.
23. C. Kohlschütter, P. A. Chirita, and W. Nejdl. Efficient parallel computation of PageRank. In Proc. 28th ECIR, pages 241-252, 2006.
24. G. Kollias and E. Gallopoulos. Asynchronous computation of PageRank computation in an interactive multithreading environment. In Web Information Retrieval and Linear Algebra Algorithms, 2007.
25. R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins,and E. Upfal. Stochastic models for the web graph. In 41th IEEE FOCS, pages 57-65, 2000.
26. R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. The web and social networks. Computer, 35(11):32-36, 2002.
27. 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.
28. J. X. Parreira, D. Donato, S. Michel, and G. Weikum. Efficient and decentralized PageRank approximation in a Peer-to-Peer Web search network. In Proc. 32nd VLDB, pages 415-426, 2006.
29. R. Rada, H. Mili, E. Bicknell, and M. Blettner. Development and application of a metric on semantic nets. IEEE Trans. on Systems, Man and Cybernetics, 19(1):17-30, 1989.
30. M. A. Serrano, A. G. Maguitman, M. Boguñá, S. Fortunato, and A. Vespignani. Decoding the structure of the WWW: A comparative analysis of Web crawls. TWEB, 1(2), 2007.
31. A. Sinclair. Algorithms for Random Generation and Counting: a Markov Chain Approach. Birkhauser Verlag, Basel, Switz., 1993.
32. A. Sinclair and M. Jerrum. Approximate counting, uniform generation and rapidly mixing markov chains. Inf. Comput., 82(1):93-133, 1989.
33. M. Strube and S. P. Ponzetto. WikiRelate≠ computing semantic relatedness using Wikipedia. In AAAI 2006, pages 1419-1424, 2006.
34. Y. Wang and D. J. DeWitt. Computing PageRank in a distributed Internet search engine system. In VLDB, pages 420-431, 2004.
35. Y. Wu. Subgraphrank: PageRank approximation for a subgraph or in a decentralized system. VLDB PhD workshop, 2007.