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. |
Year | DOI | Venue |
---|---|---|
2012 | 10.1007/978-3-642-36763-2_43 | Graph Drawing |
Keywords | Field | DocType |
node link diagram,ideal layout,view updates,dynamic graph,time-dependant clustering,time step,linear time,ideal clustering,large dynamic graph,new approach,new clustering algorithm | Canopy clustering algorithm,Data mining,Fuzzy clustering,CURE data clustering algorithm,Data stream clustering,Correlation clustering,Computer science,Theoretical computer science,Constrained clustering,Cluster analysis,Graph Layout | Conference |
Citations | PageRank | References |
25 | 0.78 | 26 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Arnaud Sallaberry | 1 | 147 | 14.86 |
Chris Muelder | 2 | 355 | 19.62 |
Kwan-Liu Ma | 3 | 5145 | 334.46 |