Discovery-driven graph summarization

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2010, Pages 880-891

  Zhang, Ning ^a   Tian, Yuanyuan ^b   Patel, Jignesh M ^a  

^a University of Wisconsin Madison   (United States)

^b IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA SETS; DOMAIN KNOWLEDGE; DRILL-DOWN; GRAPH SUMMARIES; INTERESTINGNESS MEASURES; KEY COMPONENT; KEY ISSUES; LARGE GRAPHS; LINK STRUCTURE; NODE ATTRIBUTE; NUMERICAL ATTRIBUTES; REAL DATA SETS; SOCIAL NETWORKING;

BIOLOGY;

EID: 77952750771     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2010.5447830     Document Type: Conference Paper

References (24)

1. Citeseer. http://citeseer.ist.psu.edu.
2. DBLP Bibliography. http://www.informatik.uni-trier.de/~ley/db.
3. R. Agrawal and R. Srikant. Fast algorithm for mining association rules. In Proceedings of VLDB, pages 487-499, 1994.
4. G. Battista, P. Eades, R. Tamassia, and I. Tollis. Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, 1999.
5. D. K. Blandford, G. E. Blelloch, and I. A. Kash. Compact representations of separable graphs. In SODA, pages 679-688, 2003.
6. D. Chakrabarti and C. Faloutsos. Graph mining: Laws, generators, and algorithms. ACM Comput. Surv., 38(1), 2006.
7. D. Chakrabarti, C. Faloutsos, and Y. Zhan. Visualization of large networks with min-cut plots, a-plots and r-mat. Int. J. Hum.-Comput. Stud., 65(5):434-445, 2007. (Pubitemid 46298707)
8. CNN. Facebook nearly as large as U.S. population. http://edition.cnn.com/ 2009/TECH/09/16/facebook.profit/, 2009.
9. L. Geng and H. Hamilton. Interestingness measures for data mining: A survey. ACM Computing Surveys, 38(3), 2006. (Pubitemid 44498422)
10. X. He, M.-Y. Kao, and H.-I. Lu. A fast general methodology for information - theoretically optimal encodings of graphs. In Proceedings of ESA, pages 540-549, 1999.
11. R. J. Hilderman and H. J. Hamilton. Knowledge Discovery and Measures of Interests. Kluwer Academic, Boston, MA, 2001.
12. K. Keeler and J. Westbrook. Short encodings of planar graphs and maps. Discrete Applied Mathematics, 58(3):239-252, 1995.
13. H.-I. Lu. Linear-time compression of bounded-genus graphs into information-theoretically optimal number of bits. In Proceedings of SODA, pages 223-224, 2002.
14. S. Madden and D. DeWitt. Impact of double-blind reviewing on SIGMOD publication rates. SIGMOD Record, 35(2):29-32, 2006.
15. S. Navlakha, R. Rastogi, and N. Shrivastava. Graph summarization with bounded error. In Proceedings of SIGMOD'08, pages 567-580, 2008.
16. M. E. J. Newman. The structure and function of complex networks. SIAM Review, 45:167-256, 2003.
17. M. E. J. Newman and M. Girvan. Finding and evaluating community structure in networks. Phys. Rev. E, 69:026113, 2004.
18. S. Raghavan and H. Garcia-Molina. Representing Web graphs. In Proceedings of ICDE, pages 405-416, 2003.
19. J. Sun, Y. Xie, H. Zhang, and C. Faloutsos. Less is more: Sparse graph mining with compact matrix decomposition. Stat. Anal. Data Min., 1(1):6-22, 2008.
20. Y. Tian, R. Hankins, and J. M. Patel. Efficient aggregation for graph summarization. In Proceedings of SIGMOD'08, pages 419-432, 2008.
21. A. Tung. Impact of double blind reviewing on SIGMOD publication: a more detail analysis. SIGMOD Record, 35(3):6-7, 2006.
22. N. Wang, S. Parthasarathy, K. Tan, and A. Tung. Csv: Visualizing and mining cohesive subgraphs. In Proceedings of SIGMOD'08, pages 445-458, 2008.
23. X. Xu, N. Yuruk, Z. Feng, and T. A. J. Schweiger. Scan: A structural clustering algorithm for networks. In Proceedings of KDD'07, pages 824-833, 2007.
24. X. Yang, S. Asur, S. Parthasarathy, and S. Mehta. A visual-analytic toolkit for dynamic interaction graphs. In Proceedings of KDD'08, pages 1016-1024, 2008.