Graph summarization with bounded error

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2008, Pages 419-431

  Navlakha, Saket ^a   Rastogi, Rajeev ^b   Shrivastava, Nisheeth ^c  

^a University of Maryland ^*  (United States)

^b YAHOO RESEARCH   (United States)

^c LUCENT TECHNOLOGIES   (United States)

Author keywords

Approximation; Graph compression; Minimum description length

Indexed keywords

APPROXIMATION; BOUNDED ERRORS; GRAPH COMPRESSION; GRAPH COMPRESSIONS; GRAPH DATUMS; GRAPH G; GRAPH REPRESENTATIONS; GRAPH SUMMARIES; GRAPH SUMMARIZATIONS; INPUT GRAPHS; LOSSLESS; MDL PRINCIPLES; MINIMUM DESCRIPTION LENGTH; SMALL SIZES;

AGGLOMERATION;

EID: 57149127816     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1376616.1376661     Document Type: Conference Paper

References (31)

1. M. Adler and M. Mitzenniacher, Towards compressing web graphs. In Data Compression Conference, pages 203-212, 2001.
2. V. D. Blondel, A. Gajardo, M. Heymans, P. Senellart, and P. V. Dooren. A measure of similarity between graph vertices: Applications to synonym extraction and web searching. SIAM Rev., 46(4):647-666, 2004.
3. P. Boldi and S. Vigna. The webgraph framework i: Compression techniques. In WWW, pages 595-602, 2004.
4. S. Brin and L. Page. The anatomy of a large-scale hypertextual web search engine. In WWW, pages 107-117, 1998.
5. D. Chakrabarti. Autopart: Parameter-free graph partitioning and outlier detection. In PKDD, pages 112-124, 2004.
6. K. Chakrabarti, M. N. Garofalakis, R. Rastogi, and K. Shim. Approximate query processing using wavelets. In VLDB, pages 111-122, 2000.
7. C. Cranor, T. Johnson, O. Spataschek, and V. Shkapenyuk. Gigascope: A stream database for network applications. In SIGMOD, pages 647-651, 2003.
8. I. Dhillon. Y. Guan, and B. Kulis. A fast kernel-based multilevel algorithm for graph clustering. In KDD, pages 629-634, 2005.
9. R. C. Dubes and A. K. Jain. Algorithms for Clustering Data, Prentice Hall, 1988.
10. H. N. Gabow. An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems. In STOC, pages 448-456, 1983.
11. M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, 1979.
12. D. Gibson, R. Kumar, and A. Tomkins. Discovering large dense subgraphs in massive graphs. In VLDB, pages 721-732, 2005.
13. J. M. Hellerstein, P. J. Haas, and H. J. Wang. Online aggregation. In SIGMOD, pages 171-182, 1997.
14. M. Iliofotou, P. Pappu, M. Faloutsos, M. Mitzenmacher, S. Singh, and G. Varghese. Network monitoring using traffic dispersion graphs (tdgs). In IMC, pages 315-320, 2007.
15. Y. E. Ioannidis and V. Poosala. Histogram-based approximation of set-valued query-answers. In VLDB, pages 174-185, 1999.
16. H. V. Jagadish, J. Madar, and R. T. Ng. Semantic compression and pattern extraction with fascicles. In VLDB, pages 186-198, 1999.
17. G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput., 20(l):359-392, 1998.
18. R. Kaushik, P. Shenoy, P. Bohannon, and E. Gudes. Exploiting local similarhy for indexing paths in graph-structured data. In ICDE, pages 129-140, 2002.
19. J. M. Kleinberg. Authoritative sources in a hyperlinked environment. In Journal of the ACM., volume 46, pages 604-632, 1999.
20. R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. Extracting large-scale knowledge bases from the web. In VLDB, pages 639-650, 1999.
21. R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. Trawling the web for emerging cyber-communities. In WWW, pages 1481-1493, 1999.
22. L. V. S. Lakshmanan, R. T. Ng, C. X. Wang, X. Zhou, and T. Johnson. The generalized mdl approach for summarization. In VLDB, pages 766-777, 2002.
23. T. Milo and D. Suciu. Index structures for path expressions. In ICDT, pages 277-295, 1999.
24. A. Y. Ng, M. I. Jordan, and Y. Weiss. On spectral clustering: Analysis and an algorithm. In NIPS, pages 849-856, 2001.
25. N. Polyzotis and M. Garofalakis. Xsketch synopses for XML data graphs. TODS, 31(3):1014-1063- 2006.
26. S. Raghavan and H. Garcia-Molina. Representing web graphs. In ICDE, pages 405-416, 2003.
27. K. H. Randall, R. Stata. J. L. Wiener, and R. Wickremesinghe. The link database: Fast access to graphs of the web. DCC, pages 122-131, 2002.
28. J. Rissanen. Modelling by the shortest data description. Automatica, 14:465-471, 1978.
29. P. Shannon, A. Markiel, O. Ozier, N. Baliga, J. Wang, D. Ramage, N. Amin, B. Schwikowski, and T. Ideker. Cytoscape: a software environment for integrated models of biomolecular interaction networks. Genome Res., 13(11) :2498-504, 2003.
30. T. Suel and J. Yuan. Compressing the graph structure of the web. In Data Compression Conference, pages 213-222, 2001.
31. G. Tan, M. Poletto, J. V. Guttag, and M. F. Kaashoek. Role classification of hosts within enterprise networks based on connection patterns. In USENIX Annual Technical Conference, General Track, pages 15-28, 2003.