Multiscale visualization of small world networks

被引:81
作者
Auber, D [1 ]
Chiricota, Y [1 ]
Jourdan, F [1 ]
Melançon, G [1 ]
机构
[1] LaBRI, Bordeaux, France
来源
INFOVIS 2002: IEEE SYMPOSIUM ON INFORMATION VISUALIZATION 2003, PROCEEDINGS | 2003年
关键词
small world networks; multiscale graphs; clustering metric; semantic zooming;
D O I
10.1109/INFVIS.2003.1249011
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Many networks under study in Information Visualization are "small world" networks. These networks first appeared in the study social networks and were shown to be relevant models in other application domains such as software reverse engineering and biology. Furthermore, many of these networks actually have a multiscale nature: they can be viewed as a network of groups that are themselves small world networks. We describe a metric that has been designed in order to identify the weakest edges in a small world network leading to an easy and low cost filtering procedure that breaks up a graph into smaller and highly connected components. We show how this metric can be exploited through an interactive navigation of the network based on semantic zooming. Once the network is decomposed into a hierarchy of sub-networks, a user can easily find groups and subgroups of actors and understand their dynamics.
引用
收藏
页码:75 / 81
页数:7
相关论文
共 18 条
[1]  
ADAMIC LA, SMALL WORLD WEB
[2]   RECENT DIRECTIONS IN NETLIST PARTITIONING - A SURVEY [J].
ALPERT, CJ ;
KAHNG, AB .
INTEGRATION-THE VLSI JOURNAL, 1995, 19 (1-2) :1-81
[3]  
[Anonymous], [No title captured]
[4]  
[Anonymous], GRAPH DRAWING SOFTWA
[5]  
[Anonymous], 32 ACM S THEOR COMP
[6]  
AUBER D, 2001, LECT NOTES COMPUTER, V2265
[7]  
Berkhin P., 2002, SURVEY CLUSTERING DA
[8]  
CHIRICOTA Y, 2003, 11 IEEE INT WORKSH P
[9]  
FAIRCHILD KM, 1988, COGNITIVE SCI ITS AP
[10]  
Fjallstrom P., 1998, LINKOPING ELECT ARTI, V3