graphs and networksbennani/tmpc/visd/15-graph.pdf · graphs and networks cs 7450 - information...
TRANSCRIPT
![Page 1: Graphs and Networksbennani/tmpc/VISD/15-graph.pdf · Graphs and Networks CS 7450 - Information Visualization March 2, 2004 John Stasko Spring 2004 CS 7450 2 Connections • Spence’s](https://reader035.vdocument.in/reader035/viewer/2022081522/5fb8df9bf8aa8e2a1173eb44/html5/thumbnails/1.jpg)
1
Graphs and Networks
CS 7450 - Information VisualizationMarch 2, 2004John Stasko
Spring 2004 CS 7450 2
Connections
• Spence’s chapter 8 is called Connectivity• Connections throughout our lives and the
world− Circle of friends− Delta’s flight plans− …
• Model connected set as a Graph
![Page 2: Graphs and Networksbennani/tmpc/VISD/15-graph.pdf · Graphs and Networks CS 7450 - Information Visualization March 2, 2004 John Stasko Spring 2004 CS 7450 2 Connections • Spence’s](https://reader035.vdocument.in/reader035/viewer/2022081522/5fb8df9bf8aa8e2a1173eb44/html5/thumbnails/2.jpg)
2
Spring 2004 CS 7450 3
What is a Graph?
• Vertices (nodes)connected by
• Edges (links)
1 2 30 1 01 0 10 1 0
123
1: 22: 1, 33: 2 1
32
Adjacency matrix
Adjacency list
Drawing
Spring 2004 CS 7450 4
Graph Terminology
• Graphs can have cycles• Graph edges can be directed or
undirected• The degree of a vertex is the number of
edges connected to it− In-degree and out-degree for directed graphs
• Graph edges can have values (weights) on them (nominal, ordinal or quantitative)
![Page 3: Graphs and Networksbennani/tmpc/VISD/15-graph.pdf · Graphs and Networks CS 7450 - Information Visualization March 2, 2004 John Stasko Spring 2004 CS 7450 2 Connections • Spence’s](https://reader035.vdocument.in/reader035/viewer/2022081522/5fb8df9bf8aa8e2a1173eb44/html5/thumbnails/3.jpg)
3
Spring 2004 CS 7450 5
Trees are Different
• Subcase of general graph• No cycles• Typically directed edges• Special designated root vertex
• Already examined them
Spring 2004 CS 7450 6
Graph Uses
• In information visualization, any number of data sets can be modeled as a graph− US telephone system− World Wide Web− Distribution network for on-line retailer− Call graph of a large software system− Semantic map in an AI algorithm
![Page 4: Graphs and Networksbennani/tmpc/VISD/15-graph.pdf · Graphs and Networks CS 7450 - Information Visualization March 2, 2004 John Stasko Spring 2004 CS 7450 2 Connections • Spence’s](https://reader035.vdocument.in/reader035/viewer/2022081522/5fb8df9bf8aa8e2a1173eb44/html5/thumbnails/4.jpg)
4
Spring 2004 CS 7450 7
Graph Visualization Problems
• Graph layout and positioning− Make a concrete rendering of abstract graph
• Scale− Not too much of a problem for small graphs,
but large ones are much tougher
• Navigation− How to support user changing focus and
moving around the graph
Spring 2004 CS 7450 8
Layout Algorithms
• Entire research community’s focus• Good references:
− Tutorial (talk slides)www.cs.brown.edu/people/rt/papers/gd-tutorial/gd-constraints.pdf
− G. diBattista, P. Eades, R. Tamassia, and I. Tollis, Graph Drawing: Algorithms for the Visualization of Graphs, Prentice Hall, 1999.
− Article by Herman et al
![Page 5: Graphs and Networksbennani/tmpc/VISD/15-graph.pdf · Graphs and Networks CS 7450 - Information Visualization March 2, 2004 John Stasko Spring 2004 CS 7450 2 Connections • Spence’s](https://reader035.vdocument.in/reader035/viewer/2022081522/5fb8df9bf8aa8e2a1173eb44/html5/thumbnails/5.jpg)
5
Spring 2004 CS 7450 9
Vertex Issues
• Shape• Color• Size• Location• Label
Spring 2004 CS 7450 10
General GD Information
• Good web links− www.cs.brown.edu/people/rt/gd.html− www.research.att.com/sw/tools/graphviz/− rw4.cs.uni-sb.de/users/sander/html/gstools.html
![Page 6: Graphs and Networksbennani/tmpc/VISD/15-graph.pdf · Graphs and Networks CS 7450 - Information Visualization March 2, 2004 John Stasko Spring 2004 CS 7450 2 Connections • Spence’s](https://reader035.vdocument.in/reader035/viewer/2022081522/5fb8df9bf8aa8e2a1173eb44/html5/thumbnails/6.jpg)
6
Spring 2004 CS 7450 11
Edge Issues
• Color• Size• Label• Form
− Polyline, straight line, orthogonal, grid, curved, planar, upward/downward, ...
Spring 2004 CS 7450 12
Aesthetic Considerations
•• CrossingsCrossings -- minimize towards planar•• Total Edge LengthTotal Edge Length -- minimize towards proper
scale•• AreaArea -- minimize towards efficiency•• Maximum Edge LengthMaximum Edge Length -- minimize longest
edge•• Uniform Edge LengthsUniform Edge Lengths -- minimize variances•• Total BendsTotal Bends -- minimize orthogonal towards
straight-line
![Page 7: Graphs and Networksbennani/tmpc/VISD/15-graph.pdf · Graphs and Networks CS 7450 - Information Visualization March 2, 2004 John Stasko Spring 2004 CS 7450 2 Connections • Spence’s](https://reader035.vdocument.in/reader035/viewer/2022081522/5fb8df9bf8aa8e2a1173eb44/html5/thumbnails/7.jpg)
7
Spring 2004 CS 7450 13
Layout Heuristics
• Layout algorithms can be− planar− grid-based− orthogonal− curved lines− hierarchies− circular− ...
Spring 2004 CS 7450 14
Scale Challenge
• May run out of space for vertices and edges (turns into “ball of string”)
• Can really slow down algorithm
• Often use clustering to help− Extract highly connected sets of vertices− Collapse some vertices together
![Page 8: Graphs and Networksbennani/tmpc/VISD/15-graph.pdf · Graphs and Networks CS 7450 - Information Visualization March 2, 2004 John Stasko Spring 2004 CS 7450 2 Connections • Spence’s](https://reader035.vdocument.in/reader035/viewer/2022081522/5fb8df9bf8aa8e2a1173eb44/html5/thumbnails/8.jpg)
8
Spring 2004 CS 7450 15
Layout Examples
• Homework assignment• Let’s judge!
Spring 2004 CS 7450 16
Layout Examples
• Cool java applethttp://java.sun.com/applets/jdk/1.2/demo/applets/GraphLayout/example1.html
• Examples of dynamic graph layout algorithms
![Page 9: Graphs and Networksbennani/tmpc/VISD/15-graph.pdf · Graphs and Networks CS 7450 - Information Visualization March 2, 2004 John Stasko Spring 2004 CS 7450 2 Connections • Spence’s](https://reader035.vdocument.in/reader035/viewer/2022081522/5fb8df9bf8aa8e2a1173eb44/html5/thumbnails/9.jpg)
9
Spring 2004 CS 7450 17
Graph Uses
• Facilitate understanding of complex socio-economic patterns
• Social Science visualization gallery (LotharKrempel):− http://www.mpi-fg-koeln.mpg.de/~lk/netvis.html
• Next slides: Krempel & Plumper’s study of World Trade between OECD countries, 1981 and 1992
1981http://www.mpi-fg-koeln.mpg.de/~lk/netvis/trade/WorldTrade.html
![Page 10: Graphs and Networksbennani/tmpc/VISD/15-graph.pdf · Graphs and Networks CS 7450 - Information Visualization March 2, 2004 John Stasko Spring 2004 CS 7450 2 Connections • Spence’s](https://reader035.vdocument.in/reader035/viewer/2022081522/5fb8df9bf8aa8e2a1173eb44/html5/thumbnails/10.jpg)
10
1992
Spring 2004 CS 7450 20
Graph Uses
• Facilitate understanding of network flows, relations
• Even information with a ‘geographical’ content can best appear as a ‘network’ rail maps
![Page 11: Graphs and Networksbennani/tmpc/VISD/15-graph.pdf · Graphs and Networks CS 7450 - Information Visualization March 2, 2004 John Stasko Spring 2004 CS 7450 2 Connections • Spence’s](https://reader035.vdocument.in/reader035/viewer/2022081522/5fb8df9bf8aa8e2a1173eb44/html5/thumbnails/11.jpg)
11
![Page 12: Graphs and Networksbennani/tmpc/VISD/15-graph.pdf · Graphs and Networks CS 7450 - Information Visualization March 2, 2004 John Stasko Spring 2004 CS 7450 2 Connections • Spence’s](https://reader035.vdocument.in/reader035/viewer/2022081522/5fb8df9bf8aa8e2a1173eb44/html5/thumbnails/12.jpg)
12
Spring 2004 CS 7450 24
3 Subway Diagrams
• Geographic landmarks largely suppressed on maps, except water (rivers in Paris, London) and asphalt (highways in Atlanta)− Rather fitting, no?
• These are more graphsgraphs than maps!
![Page 13: Graphs and Networksbennani/tmpc/VISD/15-graph.pdf · Graphs and Networks CS 7450 - Information Visualization March 2, 2004 John Stasko Spring 2004 CS 7450 2 Connections • Spence’s](https://reader035.vdocument.in/reader035/viewer/2022081522/5fb8df9bf8aa8e2a1173eb44/html5/thumbnails/13.jpg)
13
Spring 2004 CS 7450 25
Social Network Visualization
• Social Network Analysis (Linton Freeman)− http://www.sfu.ca/~insna
Spring 2004 CS 7450 26
People connections
Charles Isbell, Cobot
![Page 14: Graphs and Networksbennani/tmpc/VISD/15-graph.pdf · Graphs and Networks CS 7450 - Information Visualization March 2, 2004 John Stasko Spring 2004 CS 7450 2 Connections • Spence’s](https://reader035.vdocument.in/reader035/viewer/2022081522/5fb8df9bf8aa8e2a1173eb44/html5/thumbnails/14.jpg)
14
Spring 2004 CS 7450 27
Case Study
• SeeNet− Visualizing network data (phone traffic)
R. Becker, S. Eick and A. WilksAT&T
Spring 2004 CS 7450 28
Domain
• AT&T long distance phone network− 110 Nodes (switches)
Geographical location
− Connected by 12,000 linksDirected, almost completely connected
• Data every 5 minutes•• EARTHQUAKE!!!EARTHQUAKE!!!
− Oct. 17, 1989
![Page 15: Graphs and Networksbennani/tmpc/VISD/15-graph.pdf · Graphs and Networks CS 7450 - Information Visualization March 2, 2004 John Stasko Spring 2004 CS 7450 2 Connections • Spence’s](https://reader035.vdocument.in/reader035/viewer/2022081522/5fb8df9bf8aa8e2a1173eb44/html5/thumbnails/15.jpg)
15
Spring 2004 CS 7450 29
Questions
• Where are the overloads?• Which links are carrying most traffic?• Was there network damage?• Is there underutilized capacity?• Are calls getting in to affected area or are
there bottlenecks?• Is overload increasing or decreasing?
Spring 2004 CS 7450 30
Edge Drawing Strategies
116Label
Thickness
Color
116
29Directed
![Page 16: Graphs and Networksbennani/tmpc/VISD/15-graph.pdf · Graphs and Networks CS 7450 - Information Visualization March 2, 2004 John Stasko Spring 2004 CS 7450 2 Connections • Spence’s](https://reader035.vdocument.in/reader035/viewer/2022081522/5fb8df9bf8aa8e2a1173eb44/html5/thumbnails/16.jpg)
16
Spring 2004 CS 7450 31
Problems
• Too many lines!− Occlusion− Long lines become “more important”− Can’t see what happens in Midwest
• Solutions− Use half/half technique out/out− Draw most important last− Use thickness & color for traffic
Earthquake data
![Page 17: Graphs and Networksbennani/tmpc/VISD/15-graph.pdf · Graphs and Networks CS 7450 - Information Visualization March 2, 2004 John Stasko Spring 2004 CS 7450 2 Connections • Spence’s](https://reader035.vdocument.in/reader035/viewer/2022081522/5fb8df9bf8aa8e2a1173eb44/html5/thumbnails/17.jpg)
17
Spring 2004 CS 7450 33
More Help
• Shorten all lines so as to de-emphasize transcontinental links
![Page 18: Graphs and Networksbennani/tmpc/VISD/15-graph.pdf · Graphs and Networks CS 7450 - Information Visualization March 2, 2004 John Stasko Spring 2004 CS 7450 2 Connections • Spence’s](https://reader035.vdocument.in/reader035/viewer/2022081522/5fb8df9bf8aa8e2a1173eb44/html5/thumbnails/18.jpg)
18
Spring 2004 CS 7450 35
Other Applications
• Email• How would you visualize all email traffic in
CoC between pairs of people?• Solutions???
Spring 2004 CS 7450 36
Solutions
• Put everyone on circle, lines between− Color or thicken line to indicate magnitude
• Use spring/tension model− People who send a lot to each other are
drawn close together− Shows clusters of communications
![Page 19: Graphs and Networksbennani/tmpc/VISD/15-graph.pdf · Graphs and Networks CS 7450 - Information Visualization March 2, 2004 John Stasko Spring 2004 CS 7450 2 Connections • Spence’s](https://reader035.vdocument.in/reader035/viewer/2022081522/5fb8df9bf8aa8e2a1173eb44/html5/thumbnails/19.jpg)
19
Spring 2004 CS 7450 37
More Email
• How about visualizing internet traffic?
http://www.ncsa.uiuc.edu/SCMS/DigLib/text/technology/Visualization-Study-NSFNET-Cox.html
Byte traffic into the ANS/NSFnet T3 backbone for the month of November, 1993
![Page 20: Graphs and Networksbennani/tmpc/VISD/15-graph.pdf · Graphs and Networks CS 7450 - Information Visualization March 2, 2004 John Stasko Spring 2004 CS 7450 2 Connections • Spence’s](https://reader035.vdocument.in/reader035/viewer/2022081522/5fb8df9bf8aa8e2a1173eb44/html5/thumbnails/20.jpg)
20
Inbound traffic measured in billions of bytes on the NSFNET T1 backbone for September 1991
Spring 2004 CS 7450 40
Linux kernel
http://perso.wanadoo.fr/pascal.brisset/kernel3d/kernel3d.html
![Page 21: Graphs and Networksbennani/tmpc/VISD/15-graph.pdf · Graphs and Networks CS 7450 - Information Visualization March 2, 2004 John Stasko Spring 2004 CS 7450 2 Connections • Spence’s](https://reader035.vdocument.in/reader035/viewer/2022081522/5fb8df9bf8aa8e2a1173eb44/html5/thumbnails/21.jpg)
21
Spring 2004 CS 7450 41
TouchGraph
www.touchgraph.com
Spring 2004 CS 7450 42
Focus of Graph
• Particular node may be focus, often placed in center for circular layout
• How does one build an interactive system that allows changes in focus?− Use animation− Intuition about changes not always right
![Page 22: Graphs and Networksbennani/tmpc/VISD/15-graph.pdf · Graphs and Networks CS 7450 - Information Visualization March 2, 2004 John Stasko Spring 2004 CS 7450 2 Connections • Spence’s](https://reader035.vdocument.in/reader035/viewer/2022081522/5fb8df9bf8aa8e2a1173eb44/html5/thumbnails/22.jpg)
22
Spring 2004 CS 7450 43
Focus Change Animation
Straight linear interpolationof focus changes not as appealing as changes alongpolar coordinates
Yee, Fisher, Dhamija, Hearst InfoVis ‘01
Video
Spring 2004 CS 7450 44
Radial Display
• Can we combine some of the properties of the hyperbolic graphs without the hyperbolic distortion?
• Still use a radial technique with root/focus at center
![Page 23: Graphs and Networksbennani/tmpc/VISD/15-graph.pdf · Graphs and Networks CS 7450 - Information Visualization March 2, 2004 John Stasko Spring 2004 CS 7450 2 Connections • Spence’s](https://reader035.vdocument.in/reader035/viewer/2022081522/5fb8df9bf8aa8e2a1173eb44/html5/thumbnails/23.jpg)
23
Spring 2004 CS 7450 45
MoireGraphs
• Visual nodes (ie, images)• Smooth interactions• Multiple foci• Versatile
Jankun-Kelly & MaInfoVis ‘03 Video
Spring 2004 CS 7450 46
Case Study
• NicheWorks− Interactive Visualization of Very Large Graphs
Graham WillsLucent
![Page 24: Graphs and Networksbennani/tmpc/VISD/15-graph.pdf · Graphs and Networks CS 7450 - Information Visualization March 2, 2004 John Stasko Spring 2004 CS 7450 2 Connections • Spence’s](https://reader035.vdocument.in/reader035/viewer/2022081522/5fb8df9bf8aa8e2a1173eb44/html5/thumbnails/24.jpg)
24
Spring 2004 CS 7450 47
Big Graphs
• 20,000 - 1,000,000 Nodes• Works well with 50,000• Projects
− Software Engineering− Web site analysis− Large database correlation− Telephone fraud detection
Spring 2004 CS 7450 48
Features
• Typical interactive operations• Sophisticated graph layout algorithm
− 3 LayoutsCircularHexagonalTree
− 3 Incremental AlgorithmsSteepest DescentSwappingRepelling
![Page 25: Graphs and Networksbennani/tmpc/VISD/15-graph.pdf · Graphs and Networks CS 7450 - Information Visualization March 2, 2004 John Stasko Spring 2004 CS 7450 2 Connections • Spence’s](https://reader035.vdocument.in/reader035/viewer/2022081522/5fb8df9bf8aa8e2a1173eb44/html5/thumbnails/25.jpg)
25
Interface: Web Site Example
Circle layout Hexagonal layout Tree layout
Interface
![Page 26: Graphs and Networksbennani/tmpc/VISD/15-graph.pdf · Graphs and Networks CS 7450 - Information Visualization March 2, 2004 John Stasko Spring 2004 CS 7450 2 Connections • Spence’s](https://reader035.vdocument.in/reader035/viewer/2022081522/5fb8df9bf8aa8e2a1173eb44/html5/thumbnails/26.jpg)
26
Interface
Interface: Fraud Example
40,000 calls35,000 callers
![Page 27: Graphs and Networksbennani/tmpc/VISD/15-graph.pdf · Graphs and Networks CS 7450 - Information Visualization March 2, 2004 John Stasko Spring 2004 CS 7450 2 Connections • Spence’s](https://reader035.vdocument.in/reader035/viewer/2022081522/5fb8df9bf8aa8e2a1173eb44/html5/thumbnails/27.jpg)
27
Interface: Fraud Example
Spring 2004 CS 7450 54
More Neat Stuff
• http://willsfamily.org/gwills/• Lots of interesting application areas• More details on NicheWorks
![Page 28: Graphs and Networksbennani/tmpc/VISD/15-graph.pdf · Graphs and Networks CS 7450 - Information Visualization March 2, 2004 John Stasko Spring 2004 CS 7450 2 Connections • Spence’s](https://reader035.vdocument.in/reader035/viewer/2022081522/5fb8df9bf8aa8e2a1173eb44/html5/thumbnails/28.jpg)
28
Spring 2004 CS 7450 55
More Resources
• Network visualization resources− http://www.caida.org/projects/internetatlas/viz/
• Good article on graph layout− http://www.csi.uottawa.ca/ordal/papers/sander/main.html
Spring 2004 CS 7450 56
More to Come...
• Topic of WWW/InfoSphere (next) will touch on graphs and networks too
• Lots of example visualizations
![Page 29: Graphs and Networksbennani/tmpc/VISD/15-graph.pdf · Graphs and Networks CS 7450 - Information Visualization March 2, 2004 John Stasko Spring 2004 CS 7450 2 Connections • Spence’s](https://reader035.vdocument.in/reader035/viewer/2022081522/5fb8df9bf8aa8e2a1173eb44/html5/thumbnails/29.jpg)
29
Spring 2004 CS 7450 57
Upcoming
• WWW/Internet visualization− Reading
Chi et al
• Spring Break
Spring 2004 CS 7450 58
References
• Spence and CMS texts• All referred to papers and web sites• Dagon and Leahy, F ‘99 slides
![Page 30: Graphs and Networksbennani/tmpc/VISD/15-graph.pdf · Graphs and Networks CS 7450 - Information Visualization March 2, 2004 John Stasko Spring 2004 CS 7450 2 Connections • Spence’s](https://reader035.vdocument.in/reader035/viewer/2022081522/5fb8df9bf8aa8e2a1173eb44/html5/thumbnails/30.jpg)
30
Spring 2004 CS 7450 59
• Track flows and movements of individuals in society
• Next slides: Krempel’s map of Duisburg zoo visitors− Physical coordinates yields ‘ball of string’
merely reflecting the autobahn division of zoo− Gravity solution to graph shows flow
Graph Uses
Spring 2004 CS 7450 60http://www.mpi-fg-koeln.mpg.de/~lk/netvis/zoo1.html
![Page 31: Graphs and Networksbennani/tmpc/VISD/15-graph.pdf · Graphs and Networks CS 7450 - Information Visualization March 2, 2004 John Stasko Spring 2004 CS 7450 2 Connections • Spence’s](https://reader035.vdocument.in/reader035/viewer/2022081522/5fb8df9bf8aa8e2a1173eb44/html5/thumbnails/31.jpg)
31
Spring 2004 CS 7450 61