A Framework of Filtering, Clustering and Dynamic Layout Graphs for Visualization

Many classical graph visualization algorithms have already been developed over the past decades. However, these algorithms face difficulties in practice, such as the overlapping node problem, large graph layout and dynamic graph layout. In order to solve these problems, this paper aims to systematically address algorithmic issues related to a novel framework that describes the process of graph visualization applications. First of all, a framework for graph visualization is described. As the important parts of this framework, we then develop two effective algorithms for filtering and clustering large graphs for the layouts. As for the dynamic graph layout, a new approach to removing overlapping nodes called force-transfer algorithm is developed. The framework has been implemented in a prototype called PGA to demonstrate the performance of the proposed algorithms. Finally, a case study is provided.

[1]  Jean-Philippe Domenger,et al.  Skeletal Images as Visual Cues in Graph Visualization , 1999, VisSym.

[2]  Hausi A. Müller,et al.  Graph Layout Adjustment Strategies , 1995, GD.

[3]  Haim Levkowitz,et al.  From Visual Data Exploration to Visual Data Mining: A Survey , 2003, IEEE Trans. Vis. Comput. Graph..

[4]  Charles H. Hubbell.  An Input-Output Approach to Clique Identification , 1965 .

[5]  S. Dongen.  Graph clustering by flow simulation , 2000 .

[6]  Peter Eades,et al.  Journal of Graph Algorithms and Applications Navigating Clustered Graphs Using Force-directed Methods , 2022 .

[7]  Xiaodi Huang,et al.  Force-Transfer: A New Approach to Removing Overlapping Nodes in Graph Layout , 2003, ACSC.

[8]  Peter Eades,et al.  Removing edge-node intersections in drawings of graphs , 2002, Inf. Process. Lett..

[9]  Kelly A. Lyons,et al.  Algorithms for Cluster Busting in Anchored Graph Drawing , 1998, J. Graph Algorithms Appl..

[10]  Robert F. Cohen,et al.  WebOFDAV - Navigating and Visualizing the Web On-Line with Animated Context Swapping , 1998, Comput. Networks.

[11]  Jean-Philippe Domenger,et al.  Skeletal Images as Visual Cues in Graph Visualization , 1999 .

[12]  William Ribarsky,et al.  Data Visualization ’99 , 1999, Eurographics.

[13]  Horst Bunke,et al.  Recent Advances in Graph Matching , 1997, Int. J. Pattern Recognit. Artif. Intell..

[14]  P. Bonacich.  Factoring and weighting approaches to status scores and clique identification , 1972 .

[15]  Peter J. Stuckey,et al.  Removing Node Overlapping in Graph Layout Using Constrained Optimization , 2003, Constraints.

[16]  Ben Shneiderman,et al.  Structural analysis of hypertexts: identifying hierarchies and useful metrics , 1992, TOIS.

[17]  Peter Eades,et al.  Multilevel Visualization of Clustered Graphs , 1996, GD.

[18]  C. Mallows,et al.  A Method for Comparing Two Hierarchical Clusterings , 1983 .

[19]  Ivan Herman,et al.  Tree Visualisation and Navigation Clues for Information Visualisation , 1998, Comput. Graph. Forum.

[20]  Kim Marriott,et al.  Constrained Graph Layout , 1996, Constraints.

[21]  Hanno Walischewski,et al.  Automatic knowledge acquisition for spatial document interpretation , 1997, Proceedings of the Fourth International Conference on Document Analysis and Recognition.

[22]  Robert F. Cohen,et al.  An experimental study of the basis for graph drawing algorithms , 1997, JEAL.

[23]  Ed H. Chi,et al.  A taxonomy of visualization techniques using the data state reference model , 2000, IEEE Symposium on Information Visualization 2000. INFOVIS 2000. Proceedings.

[24]  Ben Shneiderman,et al.  Readings in information visualization - using vision to think , 1999 .

[25]  Tiete Lourens,et al.  A biologically plausible model for corner-based object recognition from color images , 1998 .

[26]  King-Sun Fu,et al.  Error-Correcting Isomorphisms of Attributed Relational Graphs for Pattern Analysis , 1979, IEEE Transactions on Systems, Man, and Cybernetics.

[27]  Don Coppersmith,et al.  Matrix multiplication via arithmetic progressions , 1987, STOC.

[28]  Ben Shneiderman,et al.  The eyes have it: a task by data type taxonomy for information visualizations , 1996, Proceedings 1996 IEEE Symposium on Visual Languages.

[29]  Horst Bunke.  Structural and Syntactic Pattern Recognition , 1993, Handbook of Pattern Recognition and Computer Vision.

[30]  Heidrun Schumann,et al.  A Flexible Approach for Visual Data Mining , 2002, IEEE Trans. Vis. Comput. Graph..

[31]  Mark D. Apperley,et al.  A review and taxonomy of distortion-oriented presentation techniques , 1994, TCHI.

[32]  Leo Katz,et al.  A new status index derived from sociometric analysis , 1953 .

[33]  Tyson R. Henry,et al.  Interactive graph layout: the exploration of large graphs , 1992 .

[34]  Mao Lin Huang.  Information Visualization of Attributed Relational Data , 2001, InVis.au.

[35]  Panos M. Pardalos,et al.  On maximum clique problems in very large graphs , 1999, External Memory Algorithms.

[36]  Brian Everitt,et al.  Cluster analysis , 1974 .

[37]  Kozo Sugiyama,et al.  Layout Adjustment and the Mental Map , 1995, J. Vis. Lang. Comput..