Clustering, visualizing, and navigating for large dynamic graphs

Arnaud Sallaberry, Chris Muelder, Kwan-Liu Ma

Research output: Chapter in Book/Report/Conference proceedingConference contribution

30 Citations (Scopus)

Abstract

In this paper, we present a new approach to exploring dynamic graphs. We have developed a new clustering algorithm for dynamic graphs which finds an ideal clustering for each time-step and links the clusters together. The resulting time-varying clusters are then used to define two visual representations. The first view is an overview that shows how clusters evolve over time and provides an interface to find and select interesting time-steps. The second view consists of a node link diagram of a selected time-step which uses the clustering to efficiently define the layout. By using the time-dependant clustering, we ensure the stability of our visualization and preserve user mental map by minimizing node motion, while simultaneously producing an ideal layout for each time step. Also, as the clustering is computed ahead of time, the second view updates in linear time which allows for interactivity even for graphs with upwards of tens of thousands of nodes.

Original languageEnglish (US)
Title of host publicationGraph Drawing - 20th International Symposium, GD 2012, Revised Selected Papers
Pages487-498
Number of pages12
DOIs
StatePublished - Feb 26 2013
Event20th International Symposium on Graph Drawing, GD 2012 - Redmond, WA, United States
Duration: Sep 19 2012Sep 21 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7704 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other20th International Symposium on Graph Drawing, GD 2012
CountryUnited States
CityRedmond, WA
Period9/19/129/21/12

Fingerprint

Dynamic Graphs
Clustering
Clustering algorithms
Visualization
Layout
Vertex of a graph
Interactivity
Clustering Algorithm
Linear Time
Time-varying
Diagram
Update
Motion
Graph in graph theory

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Sallaberry, A., Muelder, C., & Ma, K-L. (2013). Clustering, visualizing, and navigating for large dynamic graphs. In Graph Drawing - 20th International Symposium, GD 2012, Revised Selected Papers (pp. 487-498). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7704 LNCS). https://doi.org/10.1007/978-3-642-36763-2_43

Clustering, visualizing, and navigating for large dynamic graphs. / Sallaberry, Arnaud; Muelder, Chris; Ma, Kwan-Liu.

Graph Drawing - 20th International Symposium, GD 2012, Revised Selected Papers. 2013. p. 487-498 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7704 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Sallaberry, A, Muelder, C & Ma, K-L 2013, Clustering, visualizing, and navigating for large dynamic graphs. in Graph Drawing - 20th International Symposium, GD 2012, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7704 LNCS, pp. 487-498, 20th International Symposium on Graph Drawing, GD 2012, Redmond, WA, United States, 9/19/12. https://doi.org/10.1007/978-3-642-36763-2_43
Sallaberry A, Muelder C, Ma K-L. Clustering, visualizing, and navigating for large dynamic graphs. In Graph Drawing - 20th International Symposium, GD 2012, Revised Selected Papers. 2013. p. 487-498. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-36763-2_43
Sallaberry, Arnaud ; Muelder, Chris ; Ma, Kwan-Liu. / Clustering, visualizing, and navigating for large dynamic graphs. Graph Drawing - 20th International Symposium, GD 2012, Revised Selected Papers. 2013. pp. 487-498 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{49fdaabd6f36454f95538cfa7b7f65b7,
title = "Clustering, visualizing, and navigating for large dynamic graphs",
abstract = "In this paper, we present a new approach to exploring dynamic graphs. We have developed a new clustering algorithm for dynamic graphs which finds an ideal clustering for each time-step and links the clusters together. The resulting time-varying clusters are then used to define two visual representations. The first view is an overview that shows how clusters evolve over time and provides an interface to find and select interesting time-steps. The second view consists of a node link diagram of a selected time-step which uses the clustering to efficiently define the layout. By using the time-dependant clustering, we ensure the stability of our visualization and preserve user mental map by minimizing node motion, while simultaneously producing an ideal layout for each time step. Also, as the clustering is computed ahead of time, the second view updates in linear time which allows for interactivity even for graphs with upwards of tens of thousands of nodes.",
author = "Arnaud Sallaberry and Chris Muelder and Kwan-Liu Ma",
year = "2013",
month = "2",
day = "26",
doi = "10.1007/978-3-642-36763-2_43",
language = "English (US)",
isbn = "9783642367625",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "487--498",
booktitle = "Graph Drawing - 20th International Symposium, GD 2012, Revised Selected Papers",

}

TY - GEN

T1 - Clustering, visualizing, and navigating for large dynamic graphs

AU - Sallaberry, Arnaud

AU - Muelder, Chris

AU - Ma, Kwan-Liu

PY - 2013/2/26

Y1 - 2013/2/26

N2 - In this paper, we present a new approach to exploring dynamic graphs. We have developed a new clustering algorithm for dynamic graphs which finds an ideal clustering for each time-step and links the clusters together. The resulting time-varying clusters are then used to define two visual representations. The first view is an overview that shows how clusters evolve over time and provides an interface to find and select interesting time-steps. The second view consists of a node link diagram of a selected time-step which uses the clustering to efficiently define the layout. By using the time-dependant clustering, we ensure the stability of our visualization and preserve user mental map by minimizing node motion, while simultaneously producing an ideal layout for each time step. Also, as the clustering is computed ahead of time, the second view updates in linear time which allows for interactivity even for graphs with upwards of tens of thousands of nodes.

AB - In this paper, we present a new approach to exploring dynamic graphs. We have developed a new clustering algorithm for dynamic graphs which finds an ideal clustering for each time-step and links the clusters together. The resulting time-varying clusters are then used to define two visual representations. The first view is an overview that shows how clusters evolve over time and provides an interface to find and select interesting time-steps. The second view consists of a node link diagram of a selected time-step which uses the clustering to efficiently define the layout. By using the time-dependant clustering, we ensure the stability of our visualization and preserve user mental map by minimizing node motion, while simultaneously producing an ideal layout for each time step. Also, as the clustering is computed ahead of time, the second view updates in linear time which allows for interactivity even for graphs with upwards of tens of thousands of nodes.

UR - http://www.scopus.com/inward/record.url?scp=84874156483&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84874156483&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-36763-2_43

DO - 10.1007/978-3-642-36763-2_43

M3 - Conference contribution

AN - SCOPUS:84874156483

SN - 9783642367625

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 487

EP - 498

BT - Graph Drawing - 20th International Symposium, GD 2012, Revised Selected Papers

ER -