Intelligent Clustering for Graph Visualization

More and more areas use graphs for the representation of their data because it gives a connection-oriented perspective. Unfortunately, datasets are constantly growing in size, while devices have increasingly smaller screens (tablets, smartphones, etc). In order to reduce the quantity of elements displayed on screen, several techniques of information reduction can be used. Among them is graph clustering, which aggregates the elements of the original graph into clustered nodes and edges - thereby leading to a smaller graph. In this report, we present a tool for the interactive exploration and analysis of large clustered graphs. The tool empowers users to control the granularity of graphs either by direct interaction (collapsing/expanding clusters) or via a slider that automatically computes a clustered graph of the desired size. In a next step, we explore the use of learning algorithms to capture graph exploration preferences based on a history of user interactions.The learned parameters are then used to modify the action of the slider in view of mimicking the natural interaction/exploration behavior of the user.

[1]  Christos Faloutsos,et al.  Sampling from large graphs , 2006, KDD '06.

[2]  Martin Wattenberg,et al.  Visual exploration of multivariate graphs , 2006, CHI.

[3]  Jean-Daniel Fekete,et al.  Hierarchical Aggregation for Information Visualization: Overview, Techniques, and Design Guidelines , 2010, IEEE Transactions on Visualization and Computer Graphics.

[4]  John T. Stasko,et al.  Network-based visual analysis of tabular data , 2011, 2011 IEEE Conference on Visual Analytics Science and Technology (VAST).

[5]  Santo Fortunato,et al.  Community detection in graphs , 2009, ArXiv.

[6]  Tamara Munzner,et al.  GrouseFlocks: Steerable Exploration of Graph Hierarchy Space , 2008, IEEE Transactions on Visualization and Computer Graphics.

[7]  Jean-Loup Guillaume,et al.  Fast unfolding of communities in large networks , 2008, 0803.0476.

[8]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[9]  Mark Newman,et al.  Detecting community structure in networks , 2004 .

[10]  Claudio Castellano,et al.  Defining and identifying communities in networks. , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[11]  Arjan Kuijper,et al.  Visual Analysis of Large Graphs: State‐of‐the‐Art and Future Research Challenges , 2011, Eurographics.

[12]  Xiaodi Huang,et al.  A Framework of Filtering, Clustering and Dynamic Layout Graphs for Visualization , 2005, ACSC.

[13]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[14]  A. Arenas,et al.  Community detection in complex networks using extremal optimization. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[15]  R. Guimerà,et al.  Functional cartography of complex metabolic networks , 2005, Nature.

[16]  Jeffrey Heer,et al.  Online Submission ID : 0 Orion : A System for Modeling , Transformation and Visualization of Multidimensional Heterogeneous Networks , 2012 .

[17]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[18]  Jean-Daniel Fekete,et al.  NodeTrix: a Hybrid Visualization of Social Networks , 2007, IEEE Transactions on Visualization and Computer Graphics.

[19]  Matthias Ehrgott,et al.  Multiple criteria decision analysis: state of the art surveys , 2005 .

[20]  Jean-Daniel Fekete,et al.  ZAME: Interactive Large-Scale Graph Visualization , 2008, 2008 IEEE Pacific Visualization Symposium.

[21]  Michael Garland,et al.  On the Visualization of Social and other Scale-Free Networks , 2008, IEEE Transactions on Visualization and Computer Graphics.