Supporting the Visual Analysis of Dynamic Networks by Clustering associated Temporal Attributes

被引:33
作者
Hadlak, Steffen [1 ]
Schumann, Heidrun [1 ]
Cap, Clemens H. [1 ]
Wollenberg, Till [1 ]
机构
[1] Univ Rostock, D-18055 Rostock, Germany
关键词
Dynamic networks; visualization; supergraph clustering; EXPLORATION; TIME;
D O I
10.1109/TVCG.2013.198
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
The visual analysis of dynamic networks is a challenging task. In this paper, we introduce a new approach supporting the discovery of substructures sharing a similar trend over time by combining computation, visualization and interaction. With existing techniques, their discovery would be a tedious endeavor because of the number of nodes, edges as well as time points to be compared. First, on the basis of the supergraph, we therefore group nodes and edges according to their associated attributes that are changing over time. Second, the supergraph is visualized to provide an overview of the groups of nodes and edges with similar behavior over time in terms of their associated attributes. Third, we provide specific interactions to explore and refine the temporal clustering, allowing the user to further steer the analysis of the dynamic network. We demonstrate our approach by the visual analysis of a large wireless mesh network.
引用
收藏
页码:2267 / 2276
页数:10
相关论文
共 34 条
[1]  
Ahmed Z, 2012, IEEE CONF VIS ANAL, P13, DOI 10.1109/VAST.2012.6400493
[2]   Space-in-Time and Time-in-Space Self-Organizing Maps for Exploring Spatiotemporal Patterns [J].
Andrienko, G. ;
Andrienko, N. ;
Bremm, S. ;
Schreck, T. ;
von Landesberger, T. ;
Bak, P. ;
Keim, D. .
COMPUTER GRAPHICS FORUM, 2010, 29 (03) :913-922
[3]  
[Anonymous], 2009, Proc. Graphics Interface (GI)
[4]   Animation, Small Multiples, and the Effect of Mental Map Preservation in Dynamic Graphs [J].
Archambault, Daniel ;
Purchase, Helen C. ;
Pinaud, Bruno .
IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, 2011, 17 (04) :539-552
[5]  
Brandes U., 2003, Information Visualization, V2, P40, DOI 10.1057/palgrave.ivs.9500037
[6]   TimeRadarTrees: Visualizing dynamic compound digraphs [J].
Burch, M. ;
Diehl, S. .
COMPUTER GRAPHICS FORUM, 2008, 27 (03) :823-830
[7]   Parallel Edge Splatting for Scalable Dynamic Graph Visualization [J].
Burch, Michael ;
Vehlow, Corinna ;
Beck, Fabian ;
Diehl, Stephan ;
Weiskopf, Daniel .
IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, 2011, 17 (12) :2344-2353
[8]  
Clausen T., 2003, Optimized link state routing protocol (OLSR)
[9]  
Diehl S., 2002, Graph Drawing. 10th International Symposium, GD 2002. Revised Papers (Lecture Notes in Computer Science Vol.2528), P23
[10]   Review: A gentle introduction to imputation of missing values [J].
Donders, A. Rogier T. ;
van der Heijden, Geert J. M. G. ;
Stijnen, Theo ;
Moons, Karel G. M. .
JOURNAL OF CLINICAL EPIDEMIOLOGY, 2006, 59 (10) :1087-1091