Title: Data Visualization
1Data Visualization
- Visualization The use of computer-supported,
interactive, visual representations of data to
amplify cognition. - Information Visualization The use of
computer-supported, interactive visual
representations of abstract data to amplify
cognition. - S. Card
2Data Visualization
- Brief History
- Key Techniques
- Science versus Aesthetics
3Data Visualization Brief History
- Jacques Bertin
- Semiology of Graphics Diagrams, Networks, Maps,
1983 - coined the term using vision to think
4Data Visualization Brief History
- Edward Tufte
- The Visual Display of Quantitative Information,
2001 - Envisioning Information, 1990
- Visual Explanations Images and Quantities,
Evidence and Narrative, 1997 - The Cognitive Style of PowerPoint, 2006
- Keywords visualization of statistical data,
cartograms, history of information visualization,
visualization displays, micro and macro readings,
small multiples, escaping flatland - Tufte Home Page
- Tufte Article on Stanford Alumni Magazine
5Data Visualization Brief History
maximization of useful information on a limited
display
6Data Visualization Brief History
- Chaomei Chen
- Information Visualization Beyond the Horizon,
2004 - Mapping Scientific Frontiers The Quest for
Knowledge Visualization, 2003 - Information Visualisation and Virtual
Environments, 1999 - CiteSpace II Detecting and visualizing emerging
trends and transient patterns in scientific
literature, 2006 - Top 10 unsolved information visualization
problems, 2005 (pdf) - Keywords domain visualization, network/graph
visualizations, visualization in virtual
(collaborative) environments, social networks - Chaomei Chen Home Page
7Data Visualization Brief History
- Ben Shneiderman
- The Craft of Information Visualization Readings
and Reflections, 2003 - Readings in Information Visualization Using
Vision to Think, 1999 - Keywords human factors, HCIL, visual dynamic
query tools, social networks - Film Finder
- Ben Shneiderman on Social Networks
8Data Visualization Brief History
- Stuart Card
- A Framework for Visualization, 2002
- The Internet Edge Social, Technical, and Legal
Challenges for a Networked World, 2000 - Readings in Information Visualization Using
Vision to Think, 1999 - The Structure of the Information Visualization
Design Space (survey paper on evaluation) - Keywords HCI, Model Human Processor, GOMS
(goals, operators, methods, and selection rules)
theory of user interaction, information foraging
theory, statistical descriptions of Internet use - Stuart Card Bio
- GOMS
9Data Visualization Brief History
More on HCI Affordances Hicks Law Fitts
Law Five Hat Racks Usability Engineering Evaluatio
n
10Data Visualization Scientific
- GIS, Geographic Data Visualizations
- Therese-Marie Rhyne
- Daniel Keim
- Alan MacEachren
- Waldo Tobler (cartograms survey paper)
- Andre Skupin (cartograms perception)
11Data Visualization Scientific
- Network / Graph Visualization
- Peter Eades
- Thomas Fruchterman, Edward Reingold
- Tomihisa Kamada, Satoru Kawai
- Graph Drawing Algorithms for the Visualization
of Graphs - Stephen Eick
- Kenneth Cox
- Richard Becker (Visualizing Network Data)
- Tamara Munzner (H3viewer)
- John Lamping, Ramana Rao (FocusContext)
- George Furnas (Fisheye View)
- Graph Drawing Survey Paper
12Data Visualization Aesthetics
- Data Visualization Aesthetics
- Martin Wattenberg
- Director of Visual Communication Lab at IBM
Watson Center
13Data Visualization Aesthetics
- Data Visualization Aesthetics
- Ben Fry
- Organic information design (Anemone)
- Software visualization
- (Dismap)
- Keywords Qualitative versus quantitative
representation of data, - algorithmic design, processing, genetic
algorithms
Haplotypes
14Data Visualization Aesthetics
- Data Visualization Aesthetics
- Golan Levin
- Golan Levin Home
- Lisa Jevbratt
- Lisa Jevbratt Projects
15Data Visualization Methods
- Methods and Algorithms
- MDS,
- SOM,
- Force-Directed Placement,
- Grand tour,
- Parallel Planes,
- Glyphs,
- Node and link displays,
- Tree maps,
- Matrix representations,
- Cone trees,
- Fisheye views,
- Focuscontext views,
- Cartograms
16Data Visualization Algorithms
- Proposed to achieve several aesthetic criteria
about graph layouts - Uniform distribution of nodes
- Uniform edge lengths
- Minimum edge crossings
- Symmetry
- demo
17Data Visualization Algorithms
- Peter Eades proposed as a heuristic approach.
- The idea is to calculate attractive forces
between connected nodes and repulsive forces
between every pair of nodes. - Force models varied significantly
- Eades was complex to run in real time
- Fruchterman, Reingold reduced complexity of
Eades equations - Kamada Kawai based on Hooks law and
minimization of energy - Iterative algorithms
18Data Visualization Algorithms
19Data Visualization Algorithms
- Brief intro
- A method for dimensionality reduction, enables to
visualize 40 dimensional data on a 2D display - The idea is to keep distance relations between
nodes, proportionally consistent as you reduce
dimensions of the space - If distance in 40D space is d, then distance in
2D space should be ?d , where ? is a constant for
all elements
20Data Visualization Algorithms
- Multi-dimensional scaling
- Metric MDS methods based on eigen value analysis
of the matrix showing relatedness of every
element - Non-iterative and very costly
- If distance in 40D space is d, then distance in
2D space should be ?d , where ? is a constant for
all elements
21Data Visualization Algorithms
- Non-metric MDS is proposed by Kruskal to overcome
problems with metric MDS - Non-metric MDS defines a stress function to place
data nodes on lower dimensional space - Nodes are displaced to lower stress and
iterations are stopped when overall stress
reaches below a certain threshold - Stress function
where d ij is the distance in high dimensional
space and g ij is the distance in low dimensional
space distance function is generally the
Euclidian distance
22Data Visualization Algorithms
- Kohonen self-organizing maps
- Another way of reducing dimensions of data in a
neural networks fashion - Pseudocode for the algorithm
- 1. Initialize Map Randomize the map's nodes'
weight vectors - 2. Grab an input vector
- 3. Traverse each node in the map
- 1. Use Euclidean distance to find
similarity between the input vector and the map's
node's weight vector - 2. Track the node that produces the
smallest distance - 4. Update the nodes in the neighbourhood by
pulling them closer to the input vector
(neighborhood function) - 5. Increment t and repeat while t lt ? (total
number of iterations)
23Data Visualization Algorithms
- Initialize map Create a matrix of vectors, where
the size of these vectors is equal to the
dimensions of data and magnitudes are in the
range of data - The initial map can be totally random or
organized in a certain way, for instance
magnitudes - Neighborhood function is generally a Gaussian,
and the radius is generally reduced over
iterations
24Data Visualization Algorithms
- Resulting arrangement of the vectors on the map
is based on similarities of input data vectors. - For each vector in higher dimensions, the
position of the closest vector on the map is its
position in lower dimensional space (which is
generally 2D)
25Data Visualization Algorithms
- Processing demo
- Model Tunes