CS-GY 6313: Information Visualization
1.0.0
1.0.0
  • Introduction
  • Defining Information Visualization
  • Why Use Visualization?
  • Popular Visualization Sources and Tools
  • Why Use a Graphical Representation?
  • The Problem with Statistics
  • Why Use a Computer to Visualize Data?
  • Why Use Interaction?
  • Assessing the Quality of a Visualization
  • Data Abstraction
    • Types of Datasets
    • Types of Attributes
    • Attribute Semantics
    • Data Abstraction to Visualization
    • Data Profiling
  • Fundamental Graphs
    • Alternate Representations
    • Visualizing More Than 2 Attributes
    • Faceting
  • Data Transformation
  • Graphical Components and Mapping Strategies
    • Marks
    • Channels
    • Graphical Decoding
    • Evaluating the Quality of a Visual Encoding
    • Contextual Components
  • Color
    • Color Perception
    • Color Specification
    • Color Use
      • Quantitative Color Scales
      • Categorical Color Scales
      • Diverging Color Scales
      • Highlighting
    • Perceptual Issues with Color
  • Geo Visualization
    • When to Use Maps
    • Geo Visualization Techniques
      • Dot Maps
      • Heat Maps
      • Hexbin Maps
      • Choropleth Maps
      • Graduated Symbol Maps
      • Summary of Map Types
    • Issues with Maps
    • Visualizing Geo Data with Time
  • Visualizing Temporal Data
    • Time Structures
    • Visualization Methods
    • Increasing Visual Scalability
    • Beyond Using Position
  • Networks and Trees
    • Visualizing Network Data
      • Node-Link Diagrams
        • Clutter Reduction
      • Matrices
    • Visualizing Trees
      • Node-Link Diagrams
      • Special Kinds of Trees
      • Space-Partitioning and Containment
        • Sunburst and Icicle Plots
  • Interaction and Multiple Views
    • Single and Multiple View Methods
      • Single View Methods
      • Multiple (Linked) Views Methods
    • Common Scenarios
  • Exploring Data
  • Animation, Pacing and Exposition
Powered by GitBook
On this page
  • Dendrograms
  • Decision Trees
  • Flowcharts

Was this helpful?

  1. Networks and Trees
  2. Visualizing Trees

Special Kinds of Trees

PreviousNode-Link DiagramsNextSpace-Partitioning and Containment

Last updated 5 years ago

Was this helpful?

There are 3 special kinds of trees:

  • Dendrograms

  • Decision Trees

  • Flowcharts

Dendrograms

These are binary trees (i.e. each node has at most 2 children).

They are usually used to represent the results of a data mining technique called hierarchical clustering (an algorithm that organizes objects into a hierarchical structure based on a certain similarity metric).

The height of the line that connects nodes in a dendrogram represents the distance between the corresponding objects.

This is a versatile technique and can be used whenever a similarity/distance metric is available. They are commonly used in phylogenetic trees, using genetic distance as a metric.

Decision Trees

Every node represents a decision between 2 or more options.

Decision Trees can be built automatically from labeled data.

Flowcharts

Flowcharts can be used to visualize a process or decision flows.