Structure-based brushes: A mechanism for navigating hierarchically organized data and information spaces

被引：42

作者：

Fua, YH ^{[1
]}

Ward, MO ^{[1
]}

Rundensteiner, EA ^{[1
]}

机构：

[1] Worcester Polytech Inst, Dept Comp Sci, Worcester, MA 01609 USA

来源：

IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS | 2000年 / 6卷 / 02期

基金：

美国国家科学基金会;

关键词：

brushing; hierarchical representation; interactive selection; exploratory data analysis;

D O I：

10.1109/2945.856996

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

Interactive selection is a critical component in exploratory visualization, allowing users to isolate subsets of the displayed information for highlighting, deleting, analysis, or focused investigation. Brushing, a popular method for implementing the selection process, has traditionally been performed in either screen space or data space. In this paper, we introduce an alternate, and potentially powerful, mode of selection that we term structure-based brushing, for selection in data sets with natural or imposed structure. Our initial implementation has focused on hierarchically structured data, specifically very large multivariate data sets structured via hierarchical clustering and partitioning algorithms. The structure-based brush allows users to navigate hierarchies by specifying focal extents and level-of-detail on a visual representation of the structure. Proximity-based coloring, which maps similar colors to data that are closely related within the structure, helps convey both structural relationships and anomalies. We describe the design and implementation of our structure-based brushing tool. We also validate its usefulness using two distinct hierarchical visualization techniques, namely hierarchical parallel coordinates and tree-maps. Finally, we discuss relationships between different classes of brushes and identify methods by which structure-based brushing could be extended to alternate data structures.

引用

页码：150 / 159

页数：10

共 20 条

[1] BRUSHING SCATTERPLOTS [J].

BECKER, RA ;

CLEVELAND, WS .

TECHNOMETRICS, 1987, 29 (02) :127-142

[2]

FUA Y, 1999, P INF VIS 99 OCT, P58

[3]

FUA YH, 1999, P IEEE VIS, P43, DOI DOI 10.1109/VISUAL.1999.809866

[4]

Furnas G., 1986, P SIGCHI C HUM FACT, V17, P16, DOI [DOI 10.1145/22339.22342, DOI 10.1145/22627.22342]

[5] DYNAMIC GRAPHICS FOR EXPLORING SPATIAL DATA WITH APPLICATION TO LOCATING GLOBAL AND LOCAL ANOMALIES [J].

HASLETT, J ;

BRADLEY, R ;

CRAIG, P ;

UNWIN, A ;

WILLS, G .

AMERICAN STATISTICIAN, 1991, 45 (03) :234-242

[6]

INSELBERG A, 1990, PROCEEDINGS OF THE FIRST IEEE CONFERENCE ON VISUALIZATION - VISUALIZATION 90, P361, DOI 10.1109/VISUAL.1990.146402

[7] Reconfigurable Disc Trees for visualizing large hierarchical information space [J].

Jeong, CS ;

Pang, A .

IEEE SYMPOSIUM ON INFORMATION VISUALIZATION - PROCEEDINGS, 1998, :19-+

[8]

Johnson B., 1991, Proceedings Visualization '91 (Cat. No.91CH3046-0), P284, DOI 10.1109/VISUAL.1991.175815

[9]

Leung Y., 1994, ACM T COMPUT-HUM INT, V1, P126, DOI [DOI 10.1145/180171.180173, 10.1145/180171.180173]

[10]

Martin AR, 1995, VISUALIZATION '95 - PROCEEDINGS, P271, DOI 10.1109/VISUAL.1995.485139

← 1 2 →