Cody Dunne and Ben Shneiderman cdunne ben csumdedu 30 th Annual HumanComputer Interaction Lab Symposium May 2223 2013 College Park MD Who Uses Network Analysis Network Analysis is Hard ID: 634127
Download Presentation The PPT/PDF document "Expanding and Evaluating Network Motif S..." is the property of its rightful owner. Permission is granted to download and print the materials on this web site for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.
Slide1
Expanding and Evaluating Network Motif Simplification
Cody Dunne and Ben Shneiderman{cdunne, ben}@cs.umd.edu30th Annual Human-Computer Interaction Lab Symposium, May 22–23, 2013 College Park, MDSlide2
Who Uses Network AnalysisSlide3
Network Analysis is HardSlide4
Better Layouts
Alternate Visualizations
Hachul
&
Jünger
,
2006
Navlakha
et
al, 2008
Graph Summarization
Gove et al,
2011; Henry
&
Fekete
,
2006; Dunne
et al,
2012;
Freire
et al,
2010; Wattenberg
, 2006Slide5
2: Motifs often dominate the visualization
3: Motifs members can be functionally equivalent
Observations
1: There are repeating patterns in networks (motifs)
Lostpedia
articlesSlide6
Motif Simplification
Fan Motif2-Connector MotifSlide7
Lostpedia
articlesSlide8
Lostpedia
articlesSlide9
Glyph Design: FanSlide10
Glyph Design: ConnectorSlide11
Glyph Design: General D-ConnectorSlide12
Connector VariantsSlide13
Cliques too!Slide14
Senate Co-Voting: 65% AgreementSlide15
Senate Co-Voting: 70% AgreementSlide16
Senate Co-Voting: 80% AgreementSlide17
Interactivity
Fan motif: 133 leaf vertices with head vertex “Theory”Slide18
Interactivity in NodeXLSlide19
Motif Detection Algorithms
FansO(N)ConnectorsHandle overlapping connectorsO(N * avg. neighbor count)CliquesOverlapping clique-finding algorithmsTomita et al., 2006; Eppstein & Strash, 2011Choice heuristicsO(3^(N/3))Slide20
Controlled ExperimentSlide21Slide22Slide23Slide24
Wiki1 MS, senate MS,
Web2 more centralSlide25
Web 2 more centralSlide26
Motif Simplification Discussion
Motif simplification effective forReducing complexityUnderstanding larger or hidden relationshipsHoweverFrequent motifs may not be coveredGlyph design has tradeoffsMay be challenging at first for some tasksAvailable now in NodeXL: nodexl.codeplex.comSlide27
Funders
Social Media Research FoundationConnected Action Consulting GroupNational Science Foundation grant SBE 0915645Slide28
Motif Simplification
PapersDunne C & Shneiderman B (2013). Motif simplification: improving network visualization readability with fan, connector, and clique glyphs. In CHI '13. Shneiderman B & Dunne C (2012). Interactive network exploration to derive insights: Filtering, clustering, grouping, and simplification. In Graph Drawing '12.Available now in NodeXL: nodexl.codeplex.comCody Dunne, Ben Shneiderman{cdunne,ben}@cs.umd.edu