Matrix zoom: A visual interface to semi-external graphs

被引:55
作者
Abello, J [1 ]
van Ham, F [1 ]
机构
[1] Rutgers State Univ, DIMACS, Piscataway, NJ 08855 USA
来源
IEEE SYMPOSIUM ON INFORMATION VISUALIZATION 2004, PROCEEDINGS | 2004年
关键词
graph visualization; hierarchy trees; clustering; external memory algorithms; cancer data; phone traffic;
D O I
10.1109/INFVIS.2004.46
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In web data, telecommunications traffic and in epidemiological studies, dense subgraphs correspond to subsets of subjects (i.e. users, patients) that share a collection of attributes values (i.e. accessed web pages, email-calling patterns or disease diagnostic profiles). Visual and computational identification of these "clusters" becomes useful when domain experts desire to determine those factors of major influence in the formation of access and communication clusters or in the detection and contention of disease spread. With the current increases in graphic hardware capabilities and RAM sizes, it is more useful to relate graph sizes to the available screen real estate S and the amount of available RAM M, instead of the number of edges or nodes in the graph. We offer a visual interface that is parameterized by M and S and is particularly suited for navigation tasks that require the identification of subgraphs whose edge density is above certain threshold. This is achieved by providing a zoomable matrix view of the underlying data. This view is strongly coupled to a hierarchical view of the essential information elements present in the data domain. We illustrate the applicability of this work to the visual navigation of cancer incidence data and to an aggregated sample of phone call traffic.
引用
收藏
页码:183 / 190
页数:8
相关论文
共 14 条
[1]   MGV: A system for visualizing massive multidigraphs [J].
Abello, J ;
Korn, J .
IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, 2002, 8 (01) :21-38
[2]   A functional approach to external graph algorithms [J].
Abello, J ;
Buchsbaum, AL ;
Westbrook, JR .
ALGORITHMICA, 2002, 32 (03) :437-458
[3]  
ABELLO J, 2003, ACM C INFORMATION KN, P453
[4]  
ABELLO J, 2002, ACM P ADV CIS INT AV, P290
[5]  
ALPERT CJ, 1995, RECENT DIRECTIONS NE
[6]  
Batagelj V, 2000, ST CLASS DAT ANAL, P3
[7]  
Eades Peter, 1984, Congressus Numerantium, V42, P149, DOI DOI 10.1007/3-540-63938-1_
[8]   GRAPH DRAWING BY FORCE-DIRECTED PLACEMENT [J].
FRUCHTERMAN, TMJ ;
REINGOLD, EM .
SOFTWARE-PRACTICE & EXPERIENCE, 1991, 21 (11) :1129-1164
[9]  
JONYER I, 2001, INT J ARTIFICIAL INT, V10, P107
[10]  
KOREN Y, 2002, P 9 INT COMP COMB C, P496