Structure-Based Brushes: A Mechanism for Navigating Hierarchically Organized Data and Information Spaces
Issue No. 02 - April-June (2000 vol. 6)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/2945.856996
<p><b>Abstract</b>—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 <it>screen space</it> or <it>data space</it>. In this paper, we introduce an alternate, and potentially powerful, mode of selection that we term <it>structure-based brushing</it>, 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.</p>
Brushing, hierarchical representation, interactive selection, exploratory data analysis.
Matthew O. Ward, Elke A. Rundensteiner, Ying-Huey Fua, "Structure-Based Brushes: A Mechanism for Navigating Hierarchically Organized Data and Information Spaces", IEEE Transactions on Visualization & Computer Graphics, vol. 6, no. , pp. 150-159, April-June 2000, doi:10.1109/2945.856996