Speeding up algorithms on compressed web graphs

Proceedings of the 2nd ACM International Conference on Web Search and Data Mining, WSDM'09

Volumn , Issue , 2009, Pages 272-281

  Karande, Chinmay ^a   Chellapilla, Kumar ^b   Andersen, Reid ^b  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^b MICROSOFT   (United States)

Author keywords

Algorithms; Graph compression; Stochastic processes; Web graph analysis

Indexed keywords

BIPARTITE MATCHINGS; COMPRESSION RATIOS; DATA SETS; GRAPH ALGORITHMS; GRAPH COMPRESSION; LINK ANALYSIS; LOSSLESS COMPRESSION; MATRIX-VECTOR PRODUCTS; MODIFIED ALGORITHMS; RANDOM WALK; RUNNING TIME; SHORTEST PATH; SPEED-UPS; STOCHASTIC PROCESSES; STORAGE REQUIREMENTS; VIRTUAL NODE; WEB GRAPH ANALYSIS; WEB GRAPHS;

ALGORITHMS; IMAGE COMPRESSION; INFORMATION RETRIEVAL; RANDOM PROCESSES;

WORLD WIDE WEB;

EID: 70349133951     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1498759.1498836     Document Type: Conference Paper

References (20)

1. R. Andersen and K. J. Lang. Communities from seed sets. In WWW, pages 223-232, 2006.
2. L. Becchetti, C. Castillo, D. Donato, S. Leonardi, and R. Baeza-Yates. Using rank propagation and probabilistic counting for link-based spam detection. In Proceedings of the Workshop on Web Mining and Web Usage Analysis (WebKDD), Pennsylvania, USA, August 2006. ACM Press.
3. P. Boldi, B. Codenotti, M. Santini, and S. Vigna. Ubicrawler: A scalable fully distributed web crawler. Software: Practice & Experience, 34(8):711-726, 2004.
4. P. Boldi and S. Vigna. The webgraph framework i: compression techniques. In WWW, pages 595-602, 2004.
5. P. Boldi and S. Vigna. The webgraph framework ii: Codes for the world-wide web. In Data Compression Conference, page 528, 2004.
6. 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.
7. G. Buehrer and K. Chellapilla. A scalable pattern mining approach to web graph compression with communities. In WSDM, pages 95-106, 2008.
8. F. R. K. Chung. Spectral Graph Theory.
9. T. Feder, A. Meyerson, R. Motwani, L. O'Callaghan, and R. Panigrahy. Representing graph metrics with fewest edges. In STACS, pages 355-366, 2003.
10. T. Feder and R. Motwani. Clique partitions, graph compression and speeding-up algorithms. J. Comput. Syst. Sci., 51(2):261-272, 1995.
11. T. H. Haveliwala. Topic-sensitive pagerank: A context-sensitive ranking algorithm for web search. IEEE Trans. Knowl. Data Eng., 15(4):784-796, 2003.
12. G. Jeh and J. Widom. Scaling personalized web search. In Proceedings of the 12th World Wide Web Conference (WWW), pages 271-279, 2003.
13. R. Kannan and V. Vinay. Analyzing the structure of large graphs. Manuscript, 1999.
14. D. Kempe and F. McSherry. A decentralized algorithm for spectral analysis. J. Comput. Syst. Sci., 74(1):70-83, 2008.
15. J. M. Kleinberg. Authoritative sources in a hyperlinked environment. Journal of the ACM, 46(5):604-632, 1999.
16. R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. Trawling the web for emerging cyber-communities. Computer Networks, 31(11-16):1481-1493, 1999.
17. R. Lempel and S. Moran. The stochastic approach for link-structure analysis (SALSA) and the TKC effect. Computer Networks (Amsterdam, Netherlands: 1999), 2000.
18. F. McSherry. A uniform approach to accelerated pagerank computation. In WWW, pages 575-582, 2005.
19. 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.
20. D. Zhou, C. J. C. Burges, and T. Tao. Transductive link spam detection. In AIRWeb '07: Proceedings of the 3rd international workshop on Adversarial information retrieval on the web, pages 21-28, New York, NY, USA, 2007. ACM.