Graph Summarization Methods and Applications: A Survey

被引:194
作者
Liu, Yike [1 ]
Safavi, Tara [1 ,2 ]
Dighe, Abhilash [1 ,2 ]
Koutra, Danai [1 ,2 ]
机构
[1] Univ Michigan, Ann Arbor, MI 48109 USA
[2] 2260 Hayward St, Ann Arbor, MI 48109 USA
基金
美国国家科学基金会;
关键词
Graph mining; graph summarization; COMPRESSION; ALGORITHMS; SPARSIFICATION; DISCOVERY; NETWORKS; NEIGHBOR;
D O I
10.1145/3186727
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
While advances in computing resources have made processing enormous amounts of data possible, human ability to identify patterns in such data has not scaled accordingly. Efficient computational methods for condensing and simplifying data are thus becoming vital for extracting actionable insights. In particular, while data summarization techniques have been studied extensively, only recently has summarizing interconnected data, or graphs, become popular. This survey is a structured, comprehensive overview of the state-of-the-art methods for summarizing graph data. We first broach the motivation behind and the challenges of graph summarization. We then categorize summarization approaches by the type of graphs taken as input and further organize each category by coremethodology. Finally, we discuss applications of summarization on real-world graphs and conclude by describing some open problems in the field.
引用
收藏
页数:34
相关论文
共 180 条
[1]  
Adhikari Bijaya., 2017, Proceedings of the 2017 SIAM International Conference on Data Mining, P417
[2]   Evolutionary Network Analysis: A Survey [J].
Aggarwal, Charu ;
Subbian, Karthik .
ACM COMPUTING SURVEYS, 2014, 47 (01)
[3]  
Aggarwal CC, 2010, ADV DATABASE SYST, V40, P275, DOI 10.1007/978-1-4419-6045-0_9
[4]  
Ahmed Amr, 2013, WWW, P37
[5]   Power graph compression reveals dominant relationships in genetic transcription networks [J].
Ahnert, Sebastian E. .
MOLECULAR BIOSYSTEMS, 2013, 9 (11) :2681-2685
[6]  
Aho A. V., 1972, SIAM Journal on Computing, V1, P131, DOI 10.1137/0201008
[7]  
Akoglu Leman, 2012, SIGMOD, P717, DOI DOI 10.1145/2213836.2213941
[8]   Spectral partitioning with multiple eigenvectors [J].
Alpert, CJ ;
Kahng, AB ;
Yao, SZ .
DISCRETE APPLIED MATHEMATICS, 1999, 90 (1-3) :3-26
[9]   Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions [J].
Andoni, Alexandr ;
Indyk, Piotr .
COMMUNICATIONS OF THE ACM, 2008, 51 (01) :117-122
[10]  
[Anonymous], INFORMATICS