1 / 66

Visual Analysis of Large Graphs Using ( X , Y )-clustering and Hybrid Visualizations

Visual Analysis of Large Graphs Using ( X , Y )-clustering and Hybrid Visualizations . V. Batagelj , W. Didimo , G. Liotta , P. Palladino , M. Patrignani ( Univ. Ljubljana , Univ. Perugia, Univ. Roma Tre ) In Proc. IEEE Pacific Visualization 2010. Outline.

daria
Télécharger la présentation

Visual Analysis of Large Graphs Using ( X , Y )-clustering and Hybrid Visualizations

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Visual Analysis of Large Graphs Using (X, Y)-clustering and Hybrid Visualizations V. Batagelj, W. Didimo, G. Liotta,P. Palladino, M. Patrignani (Univ. Ljubljana, Univ. Perugia, Univ. Roma Tre) In Proc. IEEE Pacific Visualization 2010

  2. Outline • The problem of visualizing large graphs • State of the art • Our contribution • Conclusions and open problems

  3. The problem of visualizing large graphs • Some major issues in the visualization of large graphs: • Readability: optimization of aesthetic criteria • Scalability: fast computation • Visual complexity: interaction tools that allow users to limit the amount of information displayed on the screen • overview of the graph • details on demand • user’s mental map preservation

  4. State of the art • Readability: there are many effective algorithms that are computationally fast for relatively small and sparse graphs (see the graph drawing book of Di Battista, Eades, Tamassia, Tollis , 1999)

  5. State of the art • Scalability: there are some fast graph drawing algorithms based on physical or algebraic models; the drawings have high visual complexity and do not allow detailed views (see the survey of Hacul and Jünger, 2007)

  6. State of the art • Visual complexity: draw the whole graph and then interact with it; ex. focus+context techniques, like fisheye view or hyperbolic layouts; conceived for tree-like graphs (see the survey of Herman, Melançon, Marshall, 2000)

  7. State of the art • Interactive approaches for visualizing and exploring large graphs: • graph visualized incrementally or at different levels of details • strong interaction between the user and the drawing

  8. Interactive Approaches • Bottom-up strategies: the graph is visualized a piece at a time • topological window moving through canvas (Eades et al. ,1997) • Limits: no overview, the user’s mental map preservation is difficult

  9. Interactive Approaches • Bottom-up strategies: the graph is visualized a piece at a time • incremental enhancement of the drawing (ex. Carmignani et al., 2002) • Limits: no overview, the user’s mental map preservation is difficult without readability degradation

  10. Interactive Approaches • Top-down approaches

  11. Interactive Approaches • Top-down approaches • the graph is clustered (vertices are grouped together)

  12. Interactive Approaches • Top-down approaches • the graph is clustered (vertices are grouped together) • a simplified view is shown (overview)

  13. Interactive Approaches • Top-down approaches • the graph is clustered (vertices are grouped together) • a simplified view is shown (overview) • the user interactively explores the clusters (detailed views)

  14. Interactive Approaches • Top-down strategies • the graph is clustered (vertices are grouped together) • a simplified view is shown • the user interactively explores the clusters • Limits • someone/something has to define clustering rules • existing clustering algorithms do not guarantee properties on the graph of clusters

  15. Our contribution • A top-down approach with these ingredients: • a new clustering framework • new clustering algorithm within the framework • hybrid visualizations • A system: VHyXY • Some case studies

  16. Basic Terminology: Clustering • G=(V, E): graph with vertex set V and edge set E • A cluster of G=(V, E) is a subset of V • A clusteringC of G isa set of disjoint clusters of G

  17. Basic Terminology: Clustering • Thegraph of clusters H(G, C)is the graph obtained by collapsing each cluster of C into a single vertex and by replacing multiple edges with a single one

  18. Basic Terminology: Clustering • Thegraph of clusters H(G, C)is the graph obtained by collapsing each cluster of C into a single vertex and by replacing multiple edges with a single one

  19. A new clustering framework • Clustering algorithms usually detect groups of highly connected vertices without taking care of the graph of clusters • We adopt a new framework for the design of automatic clustering algorithms that guarantee: • desired properties for the clusters • desired properties for the graph of clusters

  20. The (X,Y)-clustering • X and Y are two classes of graphs with certain properties • G is called an (X,Y)-graph if there exists a clustering of G such that: • each cluster induces a subgraphthat belongs to Y • the graph of clusters belongs to X

  21. (X,Y)-graph example • Let X be the class of cycles and let Y be the class of K4

  22. (X,Y)-graph example • Let X be the class of cycles and let Y be the class of K4

  23. (X,Y)-graph example • Let X be the class of cycles and let Y be the class of K4 • The graph is a (cycle,K4)-graph

  24. Interesting combinations • Xis some class of sparse graphs: • planar graphs, cycles, trees, paths, … • Y is some class of highly connected graphs: • cliques, subgraphs with high-degree vertices, … • One can think of using different visual paradigms and algorithms for drawing the graph of clusters and the subgraph induced by each cluster (hybrid visualization)

  25. Remark on (X,Y)-clustering • (X, Y)-clustering was previously defined by Brandenburg (GD 1997), but his model requires that every vertex belongs to some cluster • Our model does not have this requirement, which poses severe practical limitations

  26. The (X,Y)-clustering problem • Problem: Given a graph G and two desired classes X and Y, is G an (X,Y)-graph? • This problem is NP-hard in general • Theorem: Deciding whether G is a (planar, k-clique)-graph for desired k ≥ 5 is NP-hard • This result motivates us to look for some relaxation of cliques

  27. K-core components • The subgraph induced by a cluster is ak-core component if it is a maximal connected subgraph such that every vertex has degree at least k 5-core component 4-core component 4-core component

  28. (Planar, K-core component)-graphs • We investigate (X,Y)-graphs G such that: • X is the class of planar graphs • Y is the class of k-core components of G • In particular, for a given k > 0, one can ask whether G is a (planar, k-core component)-graph • this decision problem can be solved in polynomial time • we give a polynomial-time algorithm that finds the maximum k for which G is a (planar, k-core component)-graph, and that computes the corresponding clustering

  29. Properties of (planar, k-core component)-graphs The union of all k-core components of G is called the k-core of G (the k-core of G, if it exists, is unique) Property. If Ghas the k-core Gk (for some k≥ 1), then Ghas the (k−1)-core G(k−1) and Gk ⊆ G(k−1) Lemma. If G is a (planar, k-core component)-graph then it is a (planar, (k−1)-core component)-graph

  30. Proof of the lemma

  31. Proof of the lemma V1 V2

  32. Proof of the lemma V1 V2 u(V1) u(V2) H(G, C)

  33. Proof of the lemma V1’ V2’ u(V1) u(V2) H(G, C)

  34. Proof of the lemma V1’ V2’ u(V1) u(V1’) u(V2) u(V2’) H(G, C) H(G, C’)

  35. Proof of the lemma V1’ V2’ u(V1) u(V1’) u(V2) u(V2’) H(G, C) H(G, C’)

  36. Clustering Algorithm • Theorem: Let G be a graph with n vertices and m edges. There exists an O((n+m)log n)-time algorithm that computes the maximum k for which G is a (planar, k-core component)-graph, and the corresponding clustering • Steps of the algorithm: • Compute core-numbers for the vertices • Perform a binary search on core-numbers • For each graph of clusters, test its planarity

  37. Algorithm animation • Compute the core number of each vertex, i.e., the maximum k for which there exists a k-core that contains the vertex

  38. Algorithm animation • Compute the core number of each vertex, i.e., the maximum k for which there exists a k-core that contains the vertex 3 4 5 3 3 2 5 3 5 2 5 4 5 4 4 5 2 4 4 1 1

  39. Algorithm animation 1 2 3 4 5 3 4 5 3 3 2 5 3 5 2 5 4 5 4 4 5 2 4 4 1 1

  40. Algorithm animation 1 2 3 4 5 3 4 5 3 3 2 5 3 5 2 5 4 5 4 4 5 2 4 4 1 1

  41. Algorithm animation 1 2 3 4 5 3 4 5 3 3 2 5 3 5 2 5 4 5 4 4 5 2 4 4 1 1

  42. Algorithm animation 1 2 3 4 5 2 2 2 1 1 G is Planar

  43. Algorithm animation 1 2 3 4 5 3 4 5 3 3 2 5 3 5 2 5 4 5 4 4 5 2 4 4 1 1

  44. Algorithm animation 1 2 3 4 5 3 4 5 3 3 2 5 3 5 2 5 4 5 4 4 5 2 4 4 1 1

  45. Algorithm animation 1 2 3 4 5 3 4 3 3 2 3 2 K5 4 4 4 2 4 4 G is not Planar 1 1

  46. Algorithm animation 1 2 3 4 5 3 4 5 3 3 2 5 3 5 2 5 4 5 4 4 5 2 4 4 1 1

  47. Algorithm animation 1 2 3 4 5 3 4 5 3 3 2 5 3 5 2 5 4 5 4 4 5 2 4 4 1 1

  48. Algorithm animation 1 2 3 4 5 3 3 3 2 3 2 Maximum k = 4 2 1 1 G is Planar

  49. Hybrid Visualizations • The (X, Y)-clustering technique can be used to design hybrid visualizations • combination of different drawing conventions for different parts of the graph • Example: • node-link representation for sparse subgraphs • matrix-based representation for dense subgraphs • Highly readable drawings for the graph of clusters (which is always planar)

  50. Matrix based representation • Matrix-based representation • vertices are rows and columns • edges are cells • The ordering of vertices in rows/columns may strongly affect the number of crossings in the drawing

More Related