Effective Path Summary Visualization on Attributed Graphs

When a new dataset is modeled as an attributed graph or users are not familiar with the data, users may not know what can be retrieved from the attributed graph. Sometimes, users may have some intuition about the query, but how to exactly formulate queries (e.g. what attribute constraints to use) is still unclear to users. In this paper, we propose the idea of attributed path summary. In general, attributed path summary is a grouping of vertices such that vertices in each group contain paths from source to destination and the entropy of attributed values within a group is low and biased toward the intuition (i.e. preferred attribute values) given by users. We propose a novel 3-phrase approach which stitches key vertices together to form candidate paths and inflates those candidate paths into path summary. An extensive case study and experimental evaluation using the real Facebook graph that visualizes the path summary demonstrates the usefulness of our proposed attributed path summary as well as the superiority of our proposed techniques.

[1]  Danai Koutra,et al.  A Graph Summarization: A Survey , 2016, ArXiv.

[2]  Sherif Sakr,et al.  G-SPARQL: a hybrid engine for querying large attributed graphs , 2012, CIKM.

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

[4]  Ivan Herman,et al.  Graph Visualization and Navigation in Information Visualization: A Survey , 2000, IEEE Trans. Vis. Comput. Graph..

[5]  Jiawei Han,et al.  Mining Graph Patterns Efficiently via Randomized Summaries , 2009, Proc. VLDB Endow..

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

[7]  Minas Gjoka,et al.  Walking in Facebook: A Case Study of Unbiased Sampling of OSNs , 2010, 2010 Proceedings IEEE INFOCOM.

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

[9]  Lei Shi,et al.  VEGAS: Visual influEnce GrAph Summarization on Citation Networks , 2015, IEEE Transactions on Knowledge and Data Engineering.

[10]  Hong Cheng,et al.  Graph Clustering Based on Structural/Attribute Similarities , 2009, Proc. VLDB Endow..

[11]  Young-Koo Lee,et al.  Set-based approximate approach for lossless graph summarization , 2015, Computing.

[12]  Divyakant Agrawal,et al.  Pagrol: Parallel graph olap over large-scale attributed graphs , 2014, 2014 IEEE 30th International Conference on Data Engineering.

[13]  Lawrence B. Holder,et al.  Substructure Discovery Using Minimum Description Length and Background Knowledge , 1993, J. Artif. Intell. Res..

[14]  M. Parimala,et al.  Graph clustering based on Structural Attribute Neighborhood Similarity (SANS) , 2015, 2015 IEEE International Conference on Electrical, Computer and Communication Technologies (ICECCT).

[15]  Jignesh M. Patel,et al.  Discovery-driven graph summarization , 2010, 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010).

[16]  François Goasdoué,et al.  Query-Oriented Summarization of RDF Graphs , 2015, BICOD.

[17]  Minsuk Kahng,et al.  Scalable graph exploration and visualization: Sensemaking challenges and opportunities , 2015, 2015 International Conference on Big Data and Smart Computing (BIGCOMP).

[18]  Alex Thomo,et al.  Zero-knowledge private graph summarization , 2013, 2013 IEEE International Conference on Big Data.

[19]  Hong Cheng,et al.  Clustering Large Attributed Graphs: An Efficient Incremental Approach , 2010, 2010 IEEE International Conference on Data Mining.