Lecture 12: Network Visualization Slides are modified from Lada Adamic, Adam Perer, Ben Shneiderman, and Aleks Aris.

Slides:



Advertisements
Similar presentations
IAT Graphs ______________________________________________________________________________________ SCHOOL OF INTERACTIVE ARTS + TECHNOLOGY [SIAT]
Advertisements

Network Visualization by Semantic Substrates Aleks Aris Ben Shneiderman.
Midwestern State University Department of Computer Science Dr. Ranette Halverson CMPS 2433 – CHAPTER 4 GRAPHS 1.
SVG Graph Browsers Data Visualization and Exploration With Directed Graphs in SVG.
TMRA TopiMaker – An Implementation of a Novel Topic Maps Visualization David De Weerdt Rani Pinchuk Richard Aked Juan-Jose de Orus Bernard Fontaine.
Force directed graph drawing Thomas van Dijk. The problem Given a set of vertices and edges, compute positions for the vertices. If the edges don’t have.
Object Detection by Matching Longin Jan Latecki. Contour-based object detection Database shapes: …..
Visual Analysis of Large Graphs Using (X, Y)-clustering and Hybrid Visualizations V. Batagelj, W. Didimo, G. Liotta, P. Palladino, M. Patrignani (Univ.
Graph Drawing Introduction 2005/2006. Graph Drawing: Introduction2 Contents Applications of graph drawing Planar graphs: some theory Different types of.
A New Force-Directed Graph Drawing Method Based on Edge- Edge Repulsion Chun-Cheng Lin and Hsu-Chen Yen Department of Electrical Engineering, National.
Graph Visualization cs5764: Information Visualization Chris North.
A tale of two tools (NVSS and VisLink) Shreya Rawal 1.
Readability Metrics for Network Visualization Cody Dunne and Ben Shneiderman Human-Computer Interaction Lab & Department of Computer Science University.
SIMS 247: Information Visualization and Presentation jeffrey heer
CSE 222 Systems Programming Graph Theory Basics Dr. Jim Holten.
Force Directed Algorithm Adel Alshayji 4/28/2005.
Network Visualization by Semantic Substrates Ben Shneiderman Aleks Aris Human-Computer Interaction Lab & Dept of Computer.
Force Directed Algorithm Adel Alshayji 4/28/2005.
Graphs G = (V,E) V is the vertex set. Vertices are also called nodes and points. E is the edge set. Each edge connects two different vertices. Edges are.
1 i247: Information Visualization and Presentation Marti Hearst April 2, 2008.
Visualization of Graph Data CS 4390/5390 Data Visualization Shirley Moore, Instructor October 6,
Information Visualization Chapter 1 - Continued. Reference Model Visualization: Mapping from data to visual form Raw DataData Tables Visual Structures.
Memoplex Browser: Searching and Browsing in Semantic Networks CPSC 533C - Project Update Yoel Lanir.
Info Vis: Multi-Dimensional Data Chris North cs3724: HCI.
1 Visual Analysis of Large Heterogeneous Social Networks by Semantic and Structural Abstraction Zequian shen, Kwan-Liu Ma, Tina Eliassi-Rad Department.
Visualization Taxonomies and Techniques Graphs University of Texas – Pan American CSCI 6361, Spring 2014.
VISUALIZATION - 10 Pavel Slavík. ENV The Screen Space Problem All techniques, sooner or later, run out of screen space Parallel co-ordinates.
IAT Graphs ______________________________________________________________________________________ SCHOOL OF INTERACTIVE ARTS + TECHNOLOGY [SIAT]
Properties of networks to be considered in their visualization Jan Terje Bjørke.
By LaBRI – INRIA Information Visualization Team. Tulip 2010 – version Tulip is an information visualization framework dedicated to the analysis.
Information Design and Visualization
2007/4/3CMSC734 Information Visualization1 Network Visualization by Semantic Substrates Ben Shneiderman and Aleks Aris Presented by: Morimichi Nishigaki,
© 2010 Pearson Addison-Wesley. All rights reserved. Addison Wesley is an imprint of Designing the User Interface: Strategies for Effective Human-Computer.
Network properties Slides are modified from Networks: Theory and Application by Lada Adamic.
© 2010 Pearson Addison-Wesley. All rights reserved. Addison Wesley is an imprint of Designing the User Interface: Strategies for Effective Human-Computer.
New method to optimize Force-directed layouts of large graphs Meva DODO, Fenohery ANDRIAMANAMPISOA, Patrice TORGUET, Jean Pierre JESSEL IRIT University.
IAT 814 Trees Chapter 3.2 of Spence ______________________________________________________________________________________ SCHOOL OF INTERACTIVE ARTS +
Representing and Using Graphs
©2007 by the McGraw-Hill Companies, Inc. All rights reserved. 2/e PPTPPT.
Readability Metrics for Network Visualization Cody Dunne and Ben Shneiderman Human-Computer Interaction Lab & Department of Computer Science University.
Visualization and analysis of microarray and gene ontology data with treemaps Eric H Baehrecke, Niem Dang, Ketan Babaria and Ben Shneiderman Presenter:
Structural Properties of Networks: Introduction Networked Life NETS 112 Fall 2015 Prof. Michael Kearns.
Attributed Visualization of Collaborative Workspaces Mao Lin Huang, Quang Vinh Nguyen and Tom Hintz Faculty of Information Technology University of Technology,
INFM 603: Information Technology and Organizational Context Jimmy Lin The iSchool University of Maryland Thursday, November 1, 2012 Session 9: Visualization.
Graphic Organizers. Free Template from 2 Index of workshop Graphic Organizers workshop.
Mathematics of Networks (Cont)
Copyright © 2005, Pearson Education, Inc. Slides from resources for: Designing the User Interface 4th Edition by Ben Shneiderman & Catherine Plaisant Slides.
Data Structures & Algorithms Graphs
IAT Text ______________________________________________________________________________________ SCHOOL OF INTERACTIVE ARTS + TECHNOLOGY [SIAT]
Graph Visualization and Beyond … Anne Denton, April 4, 2003 Including material from a paper by Ivan Herman, Guy Melançon, and M. Scott Marshall.
Representing Uncertainty, Unknowns and Dynamics of Social Networks NX-Workshop on Social Network Analysis and Visualization for Public Safety 18 – 19 October.
VizDB A tool to support Exploration of large databases By using Human Visual System To analyze mid-size to large data.
Lecture 4: Mathematics of Networks CS 790g: Complex Networks Slides are modified from Networks: Theory and Application by Lada Adamic.
Most of contents are provided by the website Graph Essentials TJTSD66: Advanced Topics in Social Media.
Network Questions: Structural 1. How many connections does the average node have? 2. Are some nodes more connected than others? 3. Is the entire network.
Module 10a: Display and Arrangement IMT530: Organization of Information Resources Winter, 2008 Michael Crandall.
CONFIDENTIAL Data Visualization Katelina Boykova 15 October 2015.
Data Visualization Fall Information Visualization Fall 2015Data Visualization2 Upon now, we dealt with scientific visualization (scivis) Scivis.
Graph theory and networks. Basic definitions  A graph consists of points called vertices (or nodes) and lines called edges (or arcs). Each edge joins.
Data Structures & Algorithms Graphs Richard Newman based on book by R. Sedgewick and slides by S. Sahni.
GRAPHS. Graph Graph terminology: vertex, edge, adjacent, incident, degree, cycle, path, connected component, spanning tree Types of graphs: undirected,
Graphs Definition: a graph is an abstract representation of a set of objects where some pairs of the objects are connected by links. The interconnected.
Canadian Bioinformatics Workshops
DATA VISUALIZATION BOB MARSHALL, MD MPH MISM FAAFP FACULTY, DOD CLINICAL INFORMATICS FELLOWSHIP.
IAT 355 Graphs ______________________________________________________________________________________.
Structural Properties of Networks: Introduction
What is Information Visualization?
Information Design and Visualization
CHAPTER 7: Information Visualization
Graphs G = (V,E) V is the vertex set.
Presentation transcript:

Lecture 12: Network Visualization Slides are modified from Lada Adamic, Adam Perer, Ben Shneiderman, and Aleks Aris

Outline What is a network? How do you analyze networks today? What are the challenges? How to integrate with other methods?

What are networks? Networks are collections of points joined by lines.  “Network” ≡ “Graph” pointslines verticesedges, arcsmath nodeslinkscomputer science sitesbondsphysics actorsties, relationssociology  node  edge 3

Network elements: edges Directed (also called arcs) A -> B A likes B, A gave a gift to B, A is B’s child Undirected A B or A – B A and B like each other A and B are siblings A and B are co-authors Edge attributes weight (e.g. frequency of communication) ranking (best friend, second best friend…) type (friend, relative, co-worker) properties depending on the structure of the rest of the graph: e.g. betweenness 4

Planar graphs A graph is planar if it can be drawn on a plane without any edges crossing

#s of planar graphs of different sizes 1:1 2:2 3:4 4:11 Every planar graph has a straight line embedding

Trees Trees are undirected graphs that contain no cycles

Cliques and complete graphs K n is the complete graph (clique) with K vertices each vertex is connected to every other vertex there are n*(n-1)/2 undirected edges K5K5 K8K8 K3K3

Outline What is a network? How do you analyze networks today? What are the challenges? How to integrate with other methods?

Why Visualization? Use the eye for pattern recognition; people are good at scanning recognizing remembering images Graphical elements facilitate comparisons via length shape orientation texture Animation shows changes across time Color helps make distinctions Aesthetics make the process appealing

Graph Drawing Aesthetics Minimize edge crossings Draw links as straight as possible Maximize minimum angle Maximize symmetry Minimize longest link Minimize drawing area Centralize high-degree nodes Distribute nodes evenly Maximize convexity (of polygons) Keep multi-link paths as straight as possible … Source: Davidson & Harel

Node Placement Methods Node-link diagrams Force-directed Geographical maps Circular layouts One or multiple concentric Temporal layouts Clustering Semantic Substrates

Force-directed Layout Also known as: Spring Spreads nodes Minimizes chance of node occlusion

Geographical Map Familiar location of nodes

Circular Layouts (1 circle) Ex: Schemaball Database schema Tables connected via foreign keys

Circular Layouts (concentric) Radial Tree Viewer

Circular (concentric) & Temporal Hudson Bay Food Web

Temporal Layout

Clustering

Hierarchical Clustering

Semantic Substrates Group nodes into regions According to an attribute Categorical, ordinal, or binned numerical In each region: Place nodes according to other attribute(s)

Force-directed >30% Familiar Layout ~30% Circular Layout ~15% Node layout strategy First 100 in visualcomplexity.com Statistics on Strategies

Outline What is a network? How do you analyze networks today? What are the challenges? How to integrate with other methods?

Challenges of Network Visualization Basic networks: nodes and links Node labels e.g. article title, book author, animal name Link labels e.g. Strength of connection, type of link Directed networks Node attributes Categorical (e.g. mammal/reptile/bird/fish/insect) Ordinal(e.g. small/medium/large) Numerical (e.g. age/weight) Link Attributes Categorical (e.g. car/train/boat/plane) Ordinal(e.g. weak/normal/strong) Numerical (e.g. probability/length/time to traverse/strength)

C1) Basic Networks (nodes & links) Power Law Graph 5000 nodes Uniformly distributed

C1) Basic Networks (continued) Social friendship network 3 degrees from Heer 47,471 people 432,430 relations

C2) Node Labels Adding labels Nodes overlap with other nodes Nodes overlap with links 250 nodes

C3) Link Labels Challenges: Length Space Belongingness Distinction from other labels & other types of labels

C4) Directed Networks Direction arrows labels Thickness color SeeNet, Becker et al.

C5 & C6) Node & Link Attributes Types: Categorical (e.g. mammal/reptile/bird/fish/insect) Ordinal(e.g. small/medium/large) Numerical (e.g. age/weight) Value of node attribute indicated by node shape Value of link attribute indicated by a letter

C1 ~12% C4 ~10% C2 ~66% Challenges First 100 in visualcomplexity.com Statistics on Challenges C5 ~10% C6 ~2% C1) Basic networks C2) Node labels C3) Link labels C4) Directed networks C5) Node attributes C6) Link attributes

Outline What is a network? How do you analyze networks today? What are the challenges? How to integrate with other methods?

Integrating with other methods  Social network analysis is inherently complex  Analysts must understand every node's attributes as well as relationships between nodes.  The visualizations are helpful but too messy and incomprehensible when data is huge. Statistics are used to detect important individuals, relationships, and clusters, Integrate this with Network visualization in which users can easily and dynamically filter nodes and edges. “Integrating Statistics and Visualization” by Adam Perer, Ben Shneiderman

Overview the network both statistically and visually  Present just sense of the structure, clusters and depth of a network  Present some statistics to provide a way to both confirm and quantify the visual findings

 Issues: Panning and zooming naively is not enough Zooming into sections of the network force users to lose the global structure.  Solution Allow user-controlled Statistics to drive the navigation Filter and Zoom to gain deeper insights

 Users can select a node to see all of its attributes.  What do we achieve? – “the ability to see each node and follow its edges to all other nodes. Details on Demand

Outline What is a network? How do you analyze networks today? What are the challenges? How to integrate with other methods?