Density Functions for Visual Attributes and Effective Partitioning in Graph Visualization
INFOVIS '00 Proceedings of the IEEE Symposium on Information Vizualization 2000
A framework for visual data mining of structures
ACSC '06 Proceedings of the 29th Australasian Computer Science Conference - Volume 48
Hi-index | 0.00 |
ABSTRACT: A clustered graph can be used to build an abstract view of its non-clustered counterpart and reduce visual complexity. The classic approach to interaction with a clustered graph is limited in scalability and efficacy, underlining the need for an overview diagram. We present a technique for the automatic generation of an overview diagram based on hierarchical clustering and discuss its application to graphs. Hierarchical clustering induces a tree structure that is useful as a map to navigate the original data set. Because the resulting overview diagram is itself a graph, it can be manipulated by the same tools that are available for graphs.