Aggregation-Based Attributed Graph Summarization

Graph summarization has a wide range of applications that involve many large-scale graph data processing problems. However, most of existing approaches for graph summarization neglect attributes and relationships residing in nodes and edges in graphs. In this paper, an aggregation-based attributed graph summarization approach is proposed by fully taking attributes and relationships into account during graph summarization. We present a new approach to quantitatively calculate node merge error, and a heuristic measure to dynamically determine the threshold of node merge error per iteration. We implemented our aggregation-based attributed graph summarization approach. Extensive experiments were made for illustrating effectiveness and efficiency of our approach in comparison with the state-of-the-art approach based on graph topology.

[1]  W. Xiong,et al.  Graph summarization for attributed graphs , 2014, 2014 International Conference on Information Science, Electronics and Electrical Engineering.

[2]  Ravi Kumar,et al.  Discovering Large Dense Subgraphs in Massive Graphs , 2005, VLDB.

[3]  Ricardo Baeza-Yates,et al.  Scalable dynamic graph summarization , 2016, 2016 IEEE International Conference on Big Data (Big Data).

[4]  Young-Koo Lee,et al.  Set-Based Unified Approach for Attributed Graph Summarization , 2014, 2014 IEEE Fourth International Conference on Big Data and Cloud Computing.

[5]  Francesco Bonchi,et al.  Graph summarization with quality guarantees , 2014, 2014 IEEE International Conference on Data Mining.

[6]  Christos Faloutsos,et al.  R-MAT: A Recursive Model for Graph Mining , 2004, SDM.

[7]  Sourav S Bhowmick,et al.  DiffNet: automatic differential functional summarization of dE-MAP networks. , 2014, Methods.

[8]  Yuanyuan Tian,et al.  Event-based social networks: linking the online and offline social worlds , 2012, KDD.

[9]  Sriram Raghavan,et al.  Representing Web graphs , 2003, Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405).

[10]  Danai Koutra,et al.  TimeCrunch: Interpretable Dynamic Graph Summarization , 2015, KDD.

[11]  Andrew McGregor,et al.  Graph stream algorithms: a survey , 2014, SGMD.

[12]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[13]  Sudipto Guha,et al.  Graph sketches: sparsification, spanners, and subgraphs , 2012, PODS.

[14]  Qi He,et al.  Distributed Graph Summarization , 2014, CIKM.

[15]  Nisheeth Shrivastava,et al.  Graph summarization with bounded error , 2008, SIGMOD Conference.

[16]  Jignesh M. Patel,et al.  Efficient aggregation for graph summarization , 2008, SIGMOD Conference.