Summarizing and understanding large graphs

Statistical Analysis and Data Mining

Volumn 8, Issue 3, 2015, Pages 183-202

  Koutra, Danai ^a   Kang, U ^b   Vreeken, Jilles ^c   Faloutsos, Christos ^a  

^a Carnegie Mellon University   (United States)

^b Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

^c MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Graph summarization; Graph visualization; Minimum description length

Indexed keywords

GRAPHIC METHODS;

GRAPH PARTITIONING ALGORITHMS; GRAPH SUMMARIZATION; GRAPH VISUALIZATION; LARGE GRAPHS; LOSSLESS COMPRESSION; MINIMUM DESCRIPTION LENGTH; MINIMUM DESCRIPTION LENGTH PRINCIPLE; NODE GRAPH; SIMPLE++; SUBGRAPHS;

GRAPH THEORY;

EID: 84929835950     PISSN: 19321864     EISSN: 19321872     Source Type: Journal    
DOI: 10.1002/sam.11267     Document Type: Article

References (63)

1. M. Faloutsos, P. Faloutsos, and C. Faloutsos, On power-law relationships of the internet topology, In Proceedings of the ACM Special Interest Group on Data Communication (SIGCOMM), Barcelona, Spain, 1999, 251-262.
2. D. Chakrabarti, Y. Zhan, D. Blandford, C. Faloutsos, and G. Blelloch, Netmine: New mining tools for large graphs, In SDM Workshop on Link Analysis, Counter-terrorism and Privacy, 2004.
3. J. Leskovec, K. J. Lang, A. Dasgupta, and M. W. Mahoney, Statistical properties of community structure in large social and information networks, In Proceedings of the 17th International Conference on World Wide Web (WWW), Beijing, China, 2008, 695-704.
4. B. A. Prakash, M. Seshadri, A. Sridharan, S. Machiraju, and C. Faloutsos, Eigenspokes: Surprising patterns and community structure in large graphs, Proceedings of the 14th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD), Hyderabad, India, 2010.
5. G. Karypis and V. Kumar, Multilevel-way hypergraph partitioning, In Proceedings of the 36th Conference on Design Automation(DAC), New Orleans, LA, 1999, 343-348.
6. D. J. Cook and L. B. Holder, Substructure discovery using minimum description length and background knowledge, J Artif Intell Res 1 (1994), 231-255.
7. T. Kamada and S. Kawai, An algorithm for drawing general undirected graphs, Infor Process Lett 31 (1989), 7-15.
8. Y. Lim, U. Kang, and C. Faloutsos, Slashburn: Graph compression and mining beyond caveman communities, IEEE Trans Knowl Data Eng, 26 (2014), 3077-3089.
9. L. Tauro, C. Palmer, G. Siganos, and M. Faloutsos, A simple conceptual model for the internet topology, Proceeding of the Global Communications Conference Exhibition and Industry Forum, San Antonio, TX, 2001.
10. J. Kleinberg, R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins, The web as a graph: Measurements, models and methods, In Proceedings of the 5th Annual International Conference (COCOON), Tokyo, Japan, 1999.
11. J. Rissanen, Modeling by shortest data description, Automatica 14 (1978), 465-471.
12. D. Koutra, U. Kang, J. Vreeken, and C. Faloutsos, VoG: Summarizing graphs using rich vocabularies, In Proceedings of the SIAM International Conference on Data Mining (SDM), Philadelphia, PA, SIAM, 2014.
13. J. Rissanen, A universal prior for integers and estimation by minimum description length, Ann Stat 11 (1983), 416-431.
14. M. Li and P. Vitáanyi, An Introduction to Kolmogorov Complexity and Its Applications, New York, Springer, 1993.
15. P. Grünwald, The Minimum Description Length Principle, Cambridge, MA, MIT Press, 2007.
16. T. M. Cover and J. A. Thomas, Elements of Information Theory, New York, Wiley-Interscience, 2006.
17. P. Miettinen and J. Vreeken, Model order selection for Boolean matrix factorization, In Proceedings of the 17th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD), San Diego, CA, 2011, 51-59.
18. P. Miettinen and J. Vreeken, mdl4bmf: Minimum description length for Boolean matrix factorization. Technical Report MPI-I-2012-5-001, Max Planck Institute for Informatics, 2012.
19. D. Koutra, T.-Y. Ke, U. Kang, D. H. Chau, H.-K. K. Pao, and C. Faloutsos, Unifying guilt-by-association approaches: Theorems and fast algorithms, In Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD), Athens, Greece, 2011, 245-260.
20. Flickr, http://www.flickr.com.
21. Snap, http://snap.stanford.edu/data/index.html.
22. Enron dataset, http://www.cs.cmu.edu/enron.
23. As-oregon dataset, http://topology.eecs.umich.edu/data.html.
24. J. Vreeken, M. van Leeuwen, and A. Siebes, Krimp: Mining itemsets that compress, Data Mining Knowl Discov 23 (2011), 169-214.
25. A. Koopman and A. Siebes, Characteristic relational patterns, In Proceedings of the 15th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD), Paris, France, 2009, 437-446.
26. N. Tatti and J. Vreeken, The long and the short of it: Summarizing event sequences with serial episodes, In Proceedings of the 18th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD), Beijing, China, 2012.
27. X. Yan and J. Han, gSpan: Graph-based substructure pattern mining, In IEEE International Conference on Data Mining, Los Alamitos, CA, 2002.
28. M. Araujo, S. Günnemann, G. Mateos, and C. Faloutsos, Beyond blocks: Hyperbolic community detection, In Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD), Nancy, France, 2014, 50-65.
29. C. Faloutsos and V. Megalooikonomou, On data mining, compression and Kolmogorov complexity, Data Mining Knowl Discov 15 (2007), 3-20.
30. R. Cilibrasi and P. Vitányi, Clustering by compression, IEEE Trans Inform Technol 51 (2005), 1523-1545.
31. M. van Leeuwen, J. Vreeken, and A. Siebes, Compression picks the item sets that matter, In Proceedings of the 10th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD), Berlin, Germany, 2006, 585-592.
32. D. Chakrabarti, S. Papadimitriou, D. S. Modha, and C. Faloutsos, Fully automatic cross-associations, In Proceedings of the 10th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD), Seattle, WA, 2004, 79-88.
33. P. Miettinen and J. Vreeken, mdl4bmf: Minimum description length for Boolean matrix factorization, ACM Trans Knowl Discov Data 8 (2014), 1-30.
34. K. Smets and J. Vreeken, The odd one out: Identifying and characterising anomalies, In Proceedings of the 11th SIAM International Conference on Data Mining (SDM), Mesa, AZ, 2011, 804-815.
35. L. Akoglu, H. Tong, J. Vreeken, and C. Faloutsos, CompreX: Compression based anomaly detection, In Proceedings of the 21st ACM Conference on Information and Knowledge Management (CIKM), Maui, HI, 2012.
36. B. A. Prakash, J. Vreeken, and C. Faloutsos, Spotting culprits in epidemics: How many and which ones? In Proceedings of the 12th IEEE International Conference on Data Mining (ICDM), Brussels, Belgium, 2012.
37. L. Akoglu, J. Vreeken, H. Tong, N. Tatti, and C. Faloutsos, Mining connection pathways for marked nodes in large graphs, In Proceedings of the SIAM International Conference on Data Mining (SDM), Austin, TX, 2013.
38. P. Boldi and S. Vigna, The webgraph framework I: compression techniques, In International World Wide Web Conference, 2004.
39. F. Chierichetti, R. Kumar, S. Lattanzi, M. Mitzenmacher, A. Panconesi, and P. Raghavan, On compressing social networks, In Proceedings of the 15th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD), Paris, France, 2009, 219-228.
40. A. Apostolico and G. Drovandi, Graph compression by bfs, Algorithms 2 (2009), 1031-1044.
41. H. Maserrat and J. Pei, Neighbor query friendly compression of social networks, In Proceedings of the 16th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD), Washington, DC, 2010.
42. J. Feng, X. He, N. Hubig, C. BÖhm, and C. Plant, Compression-based graph mining exploiting structure primitives, In Proceedings of the 13th IEEE International Conference on Data Mining (ICDM), Dallas, TX, 2013, 181-190.
43. Y. Tian, R. A. Hankins, and J. M. Patel, Efficient aggregation for graph summarization, In Proceedings of the ACM International Conference on Management of Data (SIGMOD), Vancouver, BC, 2008, 567-580.
44. N. Zhang, Y. Tian, and J. M. Patel, Discovery-driven graph summarization, In Proceedings of the 26th International Conference on Data Engineering (ICDE), Long Beach, CA, 2010, 880-891.
45. H. Toivonen, F. Zhou, A. Hartikainen, and A. Hinkka, Compression of weighted graphs, In Proceedings of the 17th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD), San Diego, CA, 2011, 965-973.
46. J. Leskovec and C. Faloutsos, Sampling from large graphs, In Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '06, New York, ACM, 2006, 631-636.
47. C. Hübler, H.-P. Kriegel, K. Borgwardt, and Z. Ghahramani, Metropolis algorithms for representative subgraph sampling, In Proceedings of the 2008 Eighth IEEE International Conference on Data Mining, ICDM '08, IEEE Computer Society, Washington, DC, USA, 2008, 283-292.
48. A. S. Maiya and T. Y. Berger-Wolf, Sampling community structure, In Proceedings of the 19th International Conference on World Wide Web (WWW), New York, ACM, 2010, 701-710.
49. D. Rafiei and S. Curial, Effectively visualizing large networks through sampling, In 16th IEEE Visualization Conference (VIS 2005), Minneapolis, MN, 2005, 48.
50. J. Dean and S. Ghemawat, Mapreduce: Simplified data processing on large clusters, In Proceedings of the Sixth Symposium on Operating Systems Design and Implementation (OSDI), San Francisco, CA, 2004.
51. A. Koopman and A. Siebes, Discovering relational items sets efficiently, In Proceedings of the 8th SIAM International Conference on Data Mining (SDM), Atlanta, GA, 2008, 108-119.
52. S. Navlakha, R. Rastogi, and N. Shrivastava, Graph summarization with bounded error, In Proceedings of the ACM International Conference on Management of Data (SIGMOD), Vancouver, BC, 2008, 419-432.
53. S. Papadimitriou, J. Sun, C. Faloutsos, and P. S. Yu, Hierarchical, parameter-free community discovery, In Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD), Antwerp, Belgium, 2008, 170-187.
54. M. Rosvall and C. T. Bergstrom, An information-theoretic framework for resolving community structure in complex networks, Proc Natl Acad Sci USA, 104 (2007), 7327-7331.
55. D. H. Chau, A. Kittur, J. I. Hong, and C. Faloutsos, Apolo: interactive large graph sensemaking by combining machine learning and visualization, In Proceedings of the 17th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD), San Diego, CA, 2011.
56. L. Akoglu, D. H. Chau, U. Kang, D. Koutra, and C. Faloutsos, Opavion: mining and visualization in large graphs, In Proceedings of the ACM International Conference on Management of Data (SIGMOD), Scottsdale, AZ, 2012.
57. U. Kang, C. Tsourakakis, and C. Faloutsos, Pegasus: A peta-scale graph mining system-implementation and observations, In Proceedings of the 9th IEEE International Conference on Data Mining (ICDM), Miami, FL, 2009.
58. L. Akoglu, M. McGlohon, and C. Faloutsos, Oddball: Spotting anomalies in weighted graphs, In Proceedings of the 14th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD), Hyderabad, India, 2010.
59. B. Shneiderman, Extreme visualization: squeezing a billion records into a million pixels, In Proceedings of the ACM International Conference on Management of Data (SIGMOD), Vancouver, BC, 2008.
60. E. Bertini and G. Santucci, By chance is not enough: Preserving relative density through non uniform sampling, In Proceedings of the Information Visualisation, 2004.
61. U. Kang, J.-Y. Lee, D. Koutra, and C. Faloutsos, Net-ray: Visualizing and mining billion-scale graphs, In Proceedings of the 18th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD), Tainan, Taiwan, 2014.
62. C. Dunne and B. Shneiderman, Motif simplification: Improving network visualization readability with fan, connector, and clique glyphs, In Proceedings of the SIGCHI Conference on Human Factors in Computing Systems (CHI), New York, ACM, 2013, 3247-3256.
63. D. Koutra, U. Kang, J. Vreeken, and C. Faloutsos, VoG: Summarizing and Understanding Large Graphs, In Proceedings of the SIAM International Conference on Data Mining (SDM), Philadelphia, PA, 2014.