53
NETWORK GRAPHS N’AT Patrick M. Dudas @pdudders

Network graphs n’at

  • Upload
    dudaspm

  • View
    189

  • Download
    0

Embed Size (px)

DESCRIPTION

network graphs, d3

Citation preview

Page 1: Network graphs n’at

NETWORK GRAPHS N’ATPatrick M. Dudas

@pdudders

Page 2: Network graphs n’at

Who Am I?

Page 3: Network graphs n’at

(And in the corner..) AI vs. IA Artificial

Intelligence John

McCarthy

Intelligence Amplification Man-Computer Symbiosis William Ross Ashby J.C.R. Licklider

Page 4: Network graphs n’at

Infographic

Infographic, Model, or Visualization

Model

http://fold.it/portal/info/about - University of Washington

Visualization

Page 5: Network graphs n’at

Data Visualization (Meetup)

Art

Data

Coding

UI/UX

Github: https://github.com/dudaspm/Pittsburgh-Data-Visualization

Page 6: Network graphs n’at

Network Graphs

Page 7: Network graphs n’at

What’s in a Name

Network graph In/Directed Graph Force-Directed Graph Force-Based Graph Node-link Diagram

Page 8: Network graphs n’at

Why Networks are Cool

Types: User -> User (Social Networks) Cosine Similarity (Documents) Co-Authorship Networks Co-Citation Networks Power/Telephone/Network Grid Biological Networks Ontology/Taxonomy

Page 9: Network graphs n’at

Terminology 101

Page 10: Network graphs n’at

Terminology 101

Page 11: Network graphs n’at

Terminology 101

Page 12: Network graphs n’at

Terminology 101

Page 13: Network graphs n’at

Sociometry/ Network Graph Theory

Page 14: Network graphs n’at

Sociometry

Page 15: Network graphs n’at

Strong/Weak Ties

Mark Granovetter Strong ties = close family Weak ties = co-workers

Page 16: Network graphs n’at

Homophily/Triadic Closure

Birds of feather flock together Geographic connections

McPherson, M., L. Smith-Lovin, et al. (2001). "Birds of a feather: Homophily in social networks." Annual review of sociology: 415-444.

Page 17: Network graphs n’at

Bridges/Structural Holes

Page 18: Network graphs n’at

Network Graph Theory

Page 19: Network graphs n’at

Degree Centrality/Groups

Degree/In-degree/Out-degree Communities

Modularity

http://boxnumbertwo.com/DoctorWho/1.1/

Page 20: Network graphs n’at

Gephi

• Open Source• Create our own tools/algorithm• Create our own layouts• Portability (Java)• Fully customizable

• Updated Wiki/Blog (very active community)• Google Summer of Code • Database Connector• Standardize input (GEXF) (Think XML of Graphs)

• Also: GML, GDF, GraphML, Pajek NET, GraphViz DOT, CSV, UCINET DL, Tulip TPL, XGMML

Page 21: Network graphs n’at

Data

Les Miserables: co-appearance weighted network of characters in the novel Les Miserables

Page 22: Network graphs n’at

D3 - http://d3js.org/

Data Driven Documents Enter, Update, Exit Interactions Transitions

Big List of Examples (1900) http://christopheviau.com/d3list/index.html

Page 23: Network graphs n’at

SVG vs. Canvas or Vector vs. Raster

Canvas = Pixels Raster

SVG Points Lines Polygons

Vector

Page 24: Network graphs n’at

When Things Go Wrong….

Page 25: Network graphs n’at

Bowl of Spaghetti

Page 26: Network graphs n’at

Hairball

Page 27: Network graphs n’at

How to Improve Graph Readability

Page 28: Network graphs n’at

28

Graph Aesthetics

Reference(s) for slide: (Marriott, Purchase, Wybrow, & Goncu, 2012)

Page 29: Network graphs n’at

Curved Lines

Reference for slide: (Xu, Rooney, Passmore, and Ham, 2012)

Page 30: Network graphs n’at

Interaction

Page 31: Network graphs n’at

31

(Versus) Selecting/Manipulating Subgraphs

Reference(s) for slide: (McGuffin & Jurisica, 2009)

Page 32: Network graphs n’at

32

Manipulation

B. Display labelsC. Change glyphD. Invert selectionE. Layout -

LinearizedF. Removed from

networkG. Layout –

CircularizedH. Nodes collapsedReference(s) for slide: (McGuffin & Jurisica, 2009)

Page 33: Network graphs n’at

33

Popup Widget or Hotbox

Ctrl-click selection and manipulation

Reference(s) for slide: (McGuffin & Jurisica, 2009)

Page 34: Network graphs n’at

Transform

Page 35: Network graphs n’at

Transform the Graph

http://www.boxnumbertwo.com/PitterPatter/1.2/

Page 36: Network graphs n’at

Chord/Circular Diagram (Alternative)

Page 37: Network graphs n’at

Étienne-Jules Marey - La method graphique (Alternative)

Page 38: Network graphs n’at

Adjacency Matrix

http://bost.ocks.org/mike/miserables/

Page 39: Network graphs n’at

Convex Hulls

Page 40: Network graphs n’at

40

Overlapper

Reference(s) for slide: (Theron, Santamaria, Garcia, Gomez, & Paz-Madrid, 2007)

Page 41: Network graphs n’at

Edge Reduction/Overlap

Page 42: Network graphs n’at

42

Confluent Drawings

Edge Overlap can be a disorienting aesthetic property

Reference(s) for slide: (Dickerson, et al., 2005)

Page 43: Network graphs n’at

43

Skeleton Edge Bundling

Reference(s) for slide: (Ersoy, Hurter, Paulovich, Cantareiro, & Telea, 2011)

Page 44: Network graphs n’at

44

Force-Based Edge Grouping/Repulsion

Reference(s) for slide: (Selassie, et al., 2011)

Page 45: Network graphs n’at

45

Interaction of LOD

Reference(s) for slide: (Zinsmaier, et al., 2012)

Page 46: Network graphs n’at

Edge Compression

Page 47: Network graphs n’at

Edge Compression Techniques

Reference(s) for slide: (Dwyer, Richie, Marriot, and Mears, 2013)

Page 49: Network graphs n’at

Bertin’s Retinal/Visual Variables

Page 50: Network graphs n’at

Bertin’s Retinal Variables

Aesthetic Description Example

Opacity of node Texture (association, selection, order)Opacity of the vertices are reduced to highlight the skeleton structure of the

network topology.

Degree/Log-degree

Size (selection, order, quantity) Vertex size vary base on the number of connection or the logarithm of number

of connection, node centrality.

Glyphs Shape (association)Glyphs are used in association with

connectivity with a table being provided to highlight the most highly

connected vertices.

Page 51: Network graphs n’at

Link Aesthetics

Aesthetic Description Example

Edge directionality FlowShowcasing the directionality of

information flow.

Color of edges Contiguous neighborsNeighbor’s categories in the same cluster [10] have the same distinct

coloring.

Curvature of edges Lombardi drawing [11]Edges are curved to provide more spacing and intern creates a less

cluttered display.

Page 52: Network graphs n’at

Gestalt Principles

Aesthetic Description Example

Color of nodes Grouping by similarityNodes that have the same color will be

cognitively grouped together.

Inner/Inter-distance bias Group by proximityNodes that are in close proximity to one

another will be seen as a single community.

Convex hulls Group by closureProviding bounding boxes or convex hulls

will encapsulate nodes in the same clusters.

Page 53: Network graphs n’at

Future Meetups

R/Ggplot2? More D3.js? Aesthetics? Need help! and a co-organizers! Help get visualizations out there! Suggestions/Comments?

Email: [email protected]