SLIDE 1
Information Visualization
Alvitta Ottley Washington University in St. Louis CSE 557A | March 01, 2018
Slides credit: Mariah Meyer, University of Utah
Information Visualization Alvitta Ottley Washington University in - - PowerPoint PPT Presentation
Information Visualization Alvitta Ottley Washington University in - - PowerPoint PPT Presentation
CSE 557A | March 01, 2018 Information Visualization Alvitta Ottley Washington University in St. Louis Slides credit: Mariah Meyer, University of Utah Gra Graph Da Data Gra Graph Da Data What can you represent as a graph? De Definition
SLIDE 2
SLIDE 3
Gra Graph Da Data
What can you represent as a graph?
SLIDE 4
De Definition
Graphs represent connections or relationships
- Social network
- Software execution (call graph)
- Gene expression
- Financial transactions
- WWW
- US telephone system
One of the oldest and most studied areas of information visualization
SLIDE 5
Wh What at Mak akes es a a Grap aph?
Node-Link Diagram
- Vertices (nodes)
- Edges (links)
Adjacency Matrix:
- 1: 2
- 2: 1, 3
- 3: 2
SLIDE 6
Ad Adjace cency ncy Matrix ix
SLIDE 7
Le Les Mi Misé sérables Ch Characters Co Co-occu
- ccurrence
ce
SLIDE 8
Id Identifying pa g patterns
Henry 2006
SLIDE 9
Ca Can you think of sho shortcomings o s of t thi his s ap approach ach?
SLIDE 10
No Node-Li Link D Diagrams
SLIDE 11
Te Term rminology
- Directed vs. Undirected
- Cyclic vs. Acyclic
- Degree of a vertex
- In-degree
- Out-degree
- Weights on edges
SLIDE 12
Te Term rminology
- Directed vs. Undirected
- Cyclic vs. Acyclic
- Degree of a vertex
- In-degree
- Out-degree
- Weights on edges
1 3 2 1 3 2
SLIDE 13
Te Term rminology
- Directed vs. Undirected
- Cyclic vs. Acyclic
- Degree of a vertex
- In-degree
- Out-degree
- Weights on edges
1 3 2 1 3 2
SLIDE 14
Te Term rminology
- Directed vs. Undirected
- Cyclic vs. Acyclic
- Degree of a vertex
- In-degree
- Out-degree
- Weights on edges
1 3 2
SLIDE 15
Te Term rminology
- Directed vs. Undirected
- Cyclic vs. Acyclic
- Degree of a vertex
- In-degree
- Out-degree
- Weights on edges
1 3 2
SLIDE 16
Mo More T Termi minolo logy gy
- Centrality Measures:
- Degree Centrality
- How many neighbors does a vertex have?
- Betweenness Centrality
- How often does a vertex appear in paths between other nodes?
- Closeness Centrality
- How quickly can a node reach all other nodes in the graph?
- Eigenvector Centrality
- Google PageRank (assumes directed graph)
SLIDE 17
Gra Graphs vs. Tre rees
- Tree is a special case of a general graph
- There are no cycles in a tree
- Edges are (usually) directed or are implicitly directed
- Special designations for root, leaves, etc.
SLIDE 18
Cha Challenge ges i s in G Graph V h Visu sualiza zation
- Graph layout and position
- Related to your studio!
- Navigation / Interaction
- How to support a user in understanding all the relationships in the graph
- Scale
- What happens if the graph has 10 nodes? 1,000 nodes? 1,000,000 nodes?
SLIDE 19
Co Comparing Representations: Which do you pre prefer r and d why?
SLIDE 20
De Dealing wi with lar large an and d me messy graph phs
SLIDE 21
Te Techniques for r Gra raph Simplification
SLIDE 22
Mo Motif G Gly lyph phs
SLIDE 23
Mo Motif G Gly lyph phs
SLIDE 24
Ed Edge Bundlin ing
SLIDE 25
Wh What t are e th the e str tren ength ths and d wea eakn knes esses es of th thes ese e approaches es?
SLIDE 26
How How do
- you
- u
cho choose se a a lay layout?
SLIDE 27
Hi Hierarchy
SLIDE 28
Ge Geos
- spatial
SLIDE 29
Wh What t if th there is is n no in intrin insic ic la layout? ut?
SLIDE 30
Fo Force ce-di dire rected d layout
SLIDE 31
Fo Force Model
SLIDE 32
Algo Algorit ithm
SLIDE 33
d3 d3 example
SLIDE 34
St Studio: io: Su Suppor
- rtin
ing I Interaction ion a and Und Understand nding ng.
How would you add interaction to a force- direction graph?