Hierarchical Techniques
Hierarchical Techniques
Hierarchical Techniques
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Part 4<br />
<strong>Hierarchical</strong> <strong>Techniques</strong><br />
Worlds-within-Worlds,<br />
Cam/Cone Trees, ...<br />
Dimensional Stacking (1/2)<br />
Partitioning of the n-dim. attribute space in 2-dim.<br />
subspace which are “stacked” into each other<br />
Partitioning of the attribute value ranges into classes<br />
Important attributes should be used on the outer levels<br />
Adequate especially for data with ordinal attributes of low<br />
cardinality<br />
© Silvia Miksch<br />
[LeBlance et al. 1990]<br />
© Silvia Miksch<br />
<strong>Hierarchical</strong> <strong>Techniques</strong><br />
Basic Idea<br />
– Visualization of Data using a <strong>Hierarchical</strong><br />
Partitioning into Subspaces<br />
Dimensional Stacking [LeBlance et al. 1990]<br />
Worlds-within-Worlds [Feiner & Besherss 1990]<br />
Treemaps [Shneiderman 1992;<br />
Johnson, 1993]<br />
Cone/Cam Trees [Robertson, Mackinlay,<br />
Card 1991]<br />
Ceops [Beaudoin et al., 1996]<br />
InfoCube [Rekimoto & Green 1993]<br />
Botanical Visualization [Kleiberg, van de Wetering<br />
& van Wijk, 2001]<br />
Dimensional Stacking (2/2)<br />
© Silvia Miksch<br />
[LeBlance et al. 1990]<br />
© Silvia Miksch
Dimensional Stacking: Example<br />
Gegeben:<br />
– m-dimensionaler Merkmalsraum mit den Variablen V1 - Vm – Mächtigkeit der Wertebereiche gegeben durch die<br />
Kardinalzahlen K1 - Km Vorgehen:<br />
– Zwei beliebige, verschiedene Var. Vi,Vk spannen ein Ki*Kk Gitter<br />
V i<br />
Beispiel 1<br />
K k<br />
V k<br />
K i<br />
[LeBlance et al. 1990]<br />
Variable: V 1-V 6<br />
Kardinalzahlen:<br />
K 1=4,K 2=2,K 3=2,K 4=3,K 5=3,K 6=2<br />
© Silvia Miksch<br />
© Silvia Miksch<br />
Dimensional Stacking: Example<br />
V i<br />
- rekursive Wiederholung innerhalb eines<br />
Gitterelementes mit weiteren Variablenpaaren<br />
K k<br />
V k<br />
K i<br />
V n<br />
Einführung einer Dummy-Variable bei 2n-1 Variablen<br />
Beispiel 2<br />
Variable: V 1 -V 6<br />
Kard.zahl: K 1 =4,K 2 =2,K 3 =2,K 4 =3,K 5 =3,K 6 =2<br />
Unterteilung P 1 (V 1 ,V 3 ),P 2 (V 4 ,V 5 ),P 3 (V 2 ,V 6 )<br />
Dargestellte Kombination: 4,2,2,3,2,2<br />
K m<br />
V m<br />
K n<br />
...<br />
© Silvia Miksch<br />
© Silvia Miksch
Funktionen auf Dim. Stacking<br />
Ausgabe der<br />
entsprechende Variablenwerte<br />
Neue Definition<br />
von Variablenpaaren<br />
Häufigkeitsangaben<br />
der Kombinationen<br />
Worlds-within-Worlds<br />
© Silvia Miksch<br />
[Feiner & Besherss 1990]<br />
Partitioning of the n-dim. Space into 3-dim. Subspace<br />
Nested 3-dim coordinates<br />
3-dim coordinate = one property<br />
Selected points --> new coordinates‘ system<br />
© Silvia Miksch<br />
Dimensional Stacking<br />
Tools:<br />
- XmdvTool -> Win9X,Linux,IRIX...<br />
Worlds-within-Worlds<br />
© Silvia Miksch<br />
[Feiner & Besherss 1990]<br />
Complete<br />
Representation<br />
3-dim. Representation<br />
no Overlapping<br />
© Silvia Miksch
Functions: Worlds-within-Worlds<br />
Units<br />
Line Graph<br />
Zoom<br />
Data: <strong>Hierarchical</strong><br />
Trees<br />
– ordered<br />
– acyclical<br />
– hierarchical<br />
[Feiner & Besherss 1990]<br />
© Silvia Miksch<br />
© Silvia Miksch<br />
Treemap<br />
Screen-Filling Methods<br />
– <strong>Hierarchical</strong> partitioning of the screen depending on the<br />
attribute values<br />
Alternative Partitioning<br />
– x- and y-dim of the Screen<br />
Attributes - User-Defined<br />
– for partitioning and their ordering<br />
Color Correspond to Add. Attributes<br />
Overview over<br />
[Shneiderman 1992; Johnson, 1993]<br />
– Large amount of hierch. data (e.g., file system)<br />
– Data with multiple ordinal attributes (e.g., census data)<br />
Horizontal vs. Vertical<br />
Horizontal<br />
– Corresponding<br />
to Text<br />
Vertical<br />
– Traditional<br />
© Silvia Miksch<br />
© Silvia Miksch
Standard Representations<br />
Venn-<br />
Diagram:<br />
Treemaps: Layouts<br />
© Silvia Miksch<br />
© Silvia Miksch<br />
Treemaps: Venn-Diagr.<br />
Nested Treemap<br />
Examples: Treemaps<br />
Treemap:<br />
© Silvia Miksch<br />
© Silvia Miksch
Treemaps (cont.)<br />
Treemap 3.0<br />
http://www.cs.umd.edu/hcil/treemap3/<br />
© Silvia Miksch<br />
© Silvia Miksch<br />
Treemap97 Software<br />
http://www.cs.umd.edu/hcil/treemaps/treemap97.shtml<br />
Cone Trees<br />
Jerome Brown<br />
Shaun Gittens<br />
Chris North<br />
[Robertson, Mackinlay, Card 1991]<br />
© Silvia Miksch<br />
© Silvia Miksch
Cone Trees vs. Cam Trees<br />
Vertical (Cone Tree) vs.<br />
Horizontal (Cam Tree)<br />
Cone Trees: Shadow, Projection<br />
With/Without<br />
Shadow<br />
Parallel Proj.,<br />
Perspective<br />
© Silvia Miksch<br />
© Silvia Miksch<br />
Cone Trees<br />
Important:<br />
Interaction!<br />
Cone trees (cont.)<br />
Alternative Layout<br />
© Silvia Miksch<br />
© Silvia Miksch
Cheops<br />
[Beaudoin et al., 1996]<br />
Botanical Visualization of Huge Hierarchies<br />
Node and link<br />
diagram<br />
© Silvia Miksch<br />
[Kleiberg, van de Wetering & van Wijk, 2001]<br />
Result of dtree1.<br />
© Silvia Miksch<br />
InfoCube<br />
[Rekimoto & Green 1993]<br />
3 D Visualization of <strong>Hierarchical</strong> Data<br />
Using Transparent Boxes<br />
dtree1<br />
© Silvia Miksch<br />
[Kleiberg, van de Wetering & van Wijk, 2001]<br />
© Silvia Miksch
Refinements<br />
Final Model<br />
[Kleiberg, van de Wetering & van Wijk, 2001]<br />
© Silvia Miksch<br />
[Kleiberg, van de Wetering & van Wijk, 2001]<br />
© Silvia Miksch<br />
Refinements<br />
Final Model<br />
[Kleiberg, van de Wetering & van Wijk, 2001]<br />
© Silvia Miksch<br />
[Kleiberg, van de Wetering & van Wijk, 2001]<br />
© Silvia Miksch
Final Model<br />
[Kleiberg, van de Wetering & van Wijk, 2001]<br />
© Silvia Miksch