Graphics Reference
In-Depth Information
Figure
.
.
Different linked hierarchical clustering views. Top right: original parallel coordinates view.
Top let: tree view of Fig.
.
, rendered in polar coordinates. Bottom: two treemap views of the tree, in
two and three dimensions
hierarchical clustering algorithm used produces a binary tree). Each of those is then
split up based on the number of children they contain, and so on until leaf nodes
are encountered. In this display a gap has been added between children to allow the
inclusion to be seen more clearly.
Summary
9.8
he power of the linking technique lies in its ability to display data in one view con-
ditionally on a user's interaction with a second view. It is therefore most useful for
goals that involve comparisons of a subset of data to the remainder. Questions like
“How are these outliers different?”, “If X is high, what effect does that have on the
