Interactive refinement of multi-scale network clusterings

被引:14
作者
Auber, D [1 ]
Jourdan, F [1 ]
机构
[1] Univ Bordeaux 1, LaBRI, F-33405 Talence, France
来源
NINTH INTERNATIONAL CONFERENCE ON INFORMATION VISUALISATION, PROCEEDINGS | 2005年
关键词
D O I
10.1109/IV.2005.65
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 [计算机科学与技术];
摘要
Insight of multiscale networks could be accessed through the visualization of automatic multiscale clusterings. But results of these methods do not necessarily fulfill user expectations since they don't provide error prone clusterings. In this article we propose a way to refine interactively these results by the use of multiscale grouping and ungrouping interactions. This approach revealed to give very good results on common networks, especially on Small World networks. Moreover the linear algorithm makes that the method remains interactive on huge graphs with thousand of nodes.
引用
收藏
页码:703 / 709
页数:7
相关论文
共 23 条
[1]
ADAMIC, 1999, SMALL WORLD WEB
[2]
[Anonymous], 1999, GRAPH DRAWING ALGORI
[3]
[Anonymous], 1995, Graph Drawing, DOI DOI 10.1007/3-540-58950-3
[4]
ARDOUREL, 2001, IEEE INT C AUT SOFTW, P311
[5]
Multiscale visualization of small world networks [J].
Auber, D ;
Chiricota, Y ;
Jourdan, F ;
Melançon, G .
INFOVIS 2002: IEEE SYMPOSIUM ON INFORMATION VISUALIZATION 2003, PROCEEDINGS, 2003, :75-81
[6]
Auber D, 2004, MATH VIS, P105
[7]
BUCHHEIM C, 2002, IMPROVING WALKERS AL
[8]
CHIRICOTA Y, 2003, 11 IEEE INT WORKSH P
[9]
Eades Peter, 1984, Congressus Numerantium, V42, P149, DOI DOI 10.1007/3-540-63938-1_
[10]
GRAPH DRAWING BY FORCE-DIRECTED PLACEMENT [J].
FRUCHTERMAN, TMJ ;
REINGOLD, EM .
SOFTWARE-PRACTICE & EXPERIENCE, 1991, 21 (11) :1129-1164