Estimating the global PageRank of web communities

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn 2006, Issue , 2006, Pages 116-125

  Davis, Jason V ^a   Dhillon, Inderjit S ^a  

^a University of Texas at Austin   (United States)

Author keywords

Algorithms; Experimentation

Indexed keywords

ALGORITHMS; INFORMATION THEORY; RESOURCE ALLOCATION; SEARCH ENGINES; WORLD WIDE WEB;

COMPUTATION TIME; EXPERIMENTATION; WEB COMMUNITIES;

DATA MINING;

EID: 33749577594     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1150402.1150419     Document Type: Conference Paper

References (22)

1. R. Baeza-Yates, M. Marin, C. Castillo, and A. Rodriguez. Crawling a country: better strategies than breadth-first for web page ordering. World- Wide Web Conference, 2005.
2. P. Boldi, M. Santini, and S. Vigna. Do your worst to make the best: paradoxical effects in pagerank' incremental computations. Workshop on Web Graphs, 3243:168-180, 2004.
3. S. Brin and L. Page. The anatomy of a large-scale hypertextual web search engine. Computer Networks and ISDN Systems, 33(1-7):107-117, 1998.
4. S. Chakrabarti, M. van den Berg, and B. Dom. Focused crawling: a new approach to topic-specific web resource discovery. World-Wide Web Conference, 1999.
5. Y. Chen, Q. Gan, and T. Suel. Local methods for estimating pagerank values. Conference on Information and Knowledge Management, 2004.
6. J. Cho, H. Garcia-Molina, and L. Page. Efficient crawling through url ordering. World- Wide Web Conference, 1998.
7. T. H. Haveliwala and S. D. Kamvar. The second eigenvalue of the Google matrix. Technical report, Stanford University, 2003.
8. T. Joachims, F. Radlinski, L. Granka, A. Cheng, C. Tillekeratne, and A. Patel. Learning retrieval functions from implicit feedback. http://www.cs. cornell.edu/People/tj/career.
9. S. D. Kamvar, T. H. Haveliwala, C. D. Manning, and G. H. Golub. Exploiting the block structure of the web for computing pagerank. World- Wide Web Conference, 2003.
10. S. D. Kamvar, T. H. Haveliwala, C. D. Manning, and G. H. Golub. Extrapolation methods for accelerating pagerank computation. World- Wide Web Conference, 2003.
11. A. N. Langville and C. D. Meyer. Deeper inside pagerank. Internet Mathematics, 2004.
12. A. N. Langville and C. D. Meyer, Updating the stationary vector of an irreducible markov chain with an eye on Google's pagerank. SIAM Journal on Matrix Analysis, 2005.
13. P. Lyman, H. R. Varian, K. Swearingen, P. Charles, N. Good, L. L. Jordan, and J. Pal. How much information 2003? School of Information Management and System, University of California at Berkely, 2003.
14. F. McSherry. A uniform approach to accelerated pagerank computation, World-Wide Web Conference, 2005.
15. C. D. Meyer. Stochastic complementation, uncoupling markov chains, and the theory of nearly reducible systems. SIAM Review, 31:240-272, 1989.
16. US News and World Report. http://www.usnews.com.
17. Dmoz open directory project. http://www.dmoz.org.
18. Nutch open source search engine. http://www.nutch.org.
19. F. Radlinski and T. Joachims. Query chains: learning to rank from implicit feedback. ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2005.
20. S. Raghavan and H. Garcia-Molina. Crawling the hidden web. In Proceedings of the Twenty-seventh International Conference on Very Large Databases, 2001.
21. T. Tin Tang, D. Hawking, N. Craswell, and K. Griffiths. Focused crawling for both topical relevance and quality of medical information. Conference on Information and Knowledge Management, 2005.
22. Y. Wang and D. J. DeWitt, Computing pagerank in a distributed internet search system. Proceedings of the 30th VLDB Conference, 2004.