VCExplorer: A Interactive Graph Exploration Framework Based on Hub Vertices with Graph Consolidation

Graphs have been widely used to model different information networks, such as the Web, biological networks and social networks (e.g. Twitter). Due to the size and complexity of these graphs, how to explore and utilize these graphs has become a very challenging problem. In this paper, we propose, VCExplorer, a new interactive graph exploration framework that integrates the strengths of graph visualization and graph summarization. Unlike existing graph visualization tools where vertices of a graph may be clustered into a smaller collection of super/virtual vertices, VCExplorer displays a small number of actual source graph vertices (called hubs) and summaries of the information between these vertices. We refer to such a graph as a HA-graph (Hub-based Aggregation Graph). This allows users to appreciate the relationship between the hubs, rather than super/virtual vertices. Users can navigate through the HA- graph by "drilling down" into the summaries between hubs to display more hubs. We illustrate how the graph aggregation techniques can be integrated into the exploring framework as the consolidated information to users. In addition, we propose efficient graph aggregation algorithms over multiple subgraphs via computation sharing. Extensive experimental evaluations have been conducted using both real and synthetic datasets and the results indicate the effectiveness and efficiency of VCExplorer for exploration.

[1]  Alan J. Dix,et al.  A Taxonomy of Clutter Reduction for Information Visualisation , 2007, IEEE Transactions on Visualization and Computer Graphics.

[2]  James Abello,et al.  ASK-GraphView: A Large Scale Graph Visualization System , 2006, IEEE Transactions on Visualization and Computer Graphics.

[3]  David Eppstein,et al.  Fast approximation of centrality , 2000, SODA '01.

[4]  Edith Cohen,et al.  Reachability and distance queries via 2-hop labels , 2002, SODA '02.

[5]  David A. Bader,et al.  Approximating Betweenness Centrality , 2007, WAW.

[6]  Jiawei Han,et al.  Graph cube: on warehousing and OLAP multidimensional networks , 2011, SIGMOD '11.

[7]  Mathieu Bastian,et al.  Gephi: An Open Source Software for Exploring and Manipulating Networks , 2009, ICWSM.

[8]  Tamara Munzner,et al.  Grouse: Feature-Based, Steerable Graph Hierarchy Exploration , 2007, EuroVis.

[9]  Jianwei Liu,et al.  An Estimation Method for Relationship Strength in Weighted Social Network Graphs , 2014 .

[10]  Yehuda Koren,et al.  Improved Circular Layouts , 2006, GD.

[11]  Jilles Vreeken,et al.  FACETS: Adaptive Local Exploration of Large Graphs , 2017, SDM.

[12]  David Eppstein,et al.  Journal of Graph Algorithms and Applications Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way , 2022 .

[13]  Danny Holten,et al.  Hierarchical Edge Bundles: Visualization of Adjacency Relations in Hierarchical Data , 2006, IEEE Transactions on Visualization and Computer Graphics.

[14]  Kim Marriott,et al.  Integrating Edge Routing into Force-Directed Layout , 2006, GD.

[15]  Jian Pei,et al.  Efficiently indexing shortest paths by exploiting symmetry in graphs , 2009, EDBT '09.

[16]  W. Cleveland,et al.  Graphical Perception: Theory, Experimentation, and Application to the Development of Graphical Methods , 1984 .

[17]  Boris Mirkin,et al.  Mathematical Classification and Clustering , 1996 .

[18]  Saul Greenberg,et al.  Navigating hierarchically clustered networks through fisheye and full-zoom methods , 1996, TCHI.

[19]  Noah E. Friedkin,et al.  Theoretical Foundations for Centrality Measures , 1991, American Journal of Sociology.

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

[21]  Gert Sabidussi,et al.  The centrality index of a graph , 1966 .

[22]  Wei Wang,et al.  Graph Summarization for Entity Relatedness Visualization , 2017, SIGIR.

[23]  Divyakant Agrawal,et al.  Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data , 2010, SIGMOD 2010.

[24]  Leonard M. Freeman,et al.  A set of measures of centrality based upon betweenness , 1977 .

[25]  Joachim Gudmundsson,et al.  Increasing the readability of graph drawings with centrality-based scaling , 2006, APVIS.

[26]  Philip S. Yu,et al.  Dual Labeling: Answering Graph Reachability Queries in Constant Time , 2006, 22nd International Conference on Data Engineering (ICDE'06).

[27]  Ulrik Brandes,et al.  Communicating Centrality in Policy Network Drawings , 1999, IEEE Trans. Vis. Comput. Graph..

[28]  Christophe Hurter,et al.  Skeleton-Based Edge Bundling for Graph Visualization , 2011, IEEE Transactions on Visualization and Computer Graphics.

[29]  Yang Xiang,et al.  A highway-centric labeling approach for answering distance queries on large sparse graphs , 2012, SIGMOD Conference.

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

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