EgoNetCloud: Event-based Egocentric Dynamic Network Visualization - - PowerPoint PPT Presentation

egonetcloud event based egocentric dynamic network
SMART_READER_LITE
LIVE PREVIEW

EgoNetCloud: Event-based Egocentric Dynamic Network Visualization - - PowerPoint PPT Presentation

EgoNetCloud: Event-based Egocentric Dynamic Network Visualization Qingsong Liu, Yifan Hu, Lei Shi, Xinzhu Mu, Yutao Zhang, Jie Tang IEEE VIS 2015 Presented by: Dylan 1 Context Event-based Egocentric Dynamic Network time-varying graph


slide-1
SLIDE 1

EgoNetCloud: Event-based Egocentric Dynamic Network Visualization

Qingsong Liu, Yifan Hu, Lei Shi, Xinzhu Mu, Yutao Zhang, Jie Tang IEEE VIS 2015

Presented by: Dylan

1

slide-2
SLIDE 2

Context

Event-based Egocentric Dynamic Network

  • time-varying graph

discrete time point continuous time period

time set

activation time

2

slide-3
SLIDE 3

Context

Event-based Egocentric Dynamic Network

  • in event-based network,

discrete time point (continuous time period) of the edge is associated with an event

  • every dynamic network can

be seen as event-based

  • establishing a friendship tie in
  • nline social networks


sending a mobile short message

3

slide-4
SLIDE 4

Context

Event-based Egocentric Dynamic Network

  • subgraph of the full-scale graph
  • node: ego node vs. alter node
  • edge: ego -> alter; alter -> alter
  • help understand the role of the ego in full-scale network

4

slide-5
SLIDE 5

Problems

  • visual clutter
  • edge crossing

5

slide-6
SLIDE 6

Goals

  • reveal egocentric network structure
  • reveal the temporal dynamics of the ego/ alter

nodes

  • requirements on performance, visual metaphor,

layout constraint

  • redesign interaction

6

slide-7
SLIDE 7

Contributions

  • Data-driven empirical algorithms: prune, compress and filter

networks into smaller but more informative abstractions

  • EgoNetCloud visual metaphor and interactions: display

and explore both the egocentric network structure and their temporal dynamics

  • Fast and constrained layout computation: fulfill requirement
  • f the new visual metaphor and maintain fine readability
  • Comprehensive evaluations: demonstrate the effectiveness
  • f the EgoNetCloud design through a user study and a real-

world case study

7

slide-8
SLIDE 8

Levels of Design

Domain situation Observe target users using existing tools Visual encoding/interaction idiom Justify design with respect to alternatives Algorithm Measure system time/memory Analyze computational complexity Observe target users after deployment (fjeld study) Measure adoption Analyze results qualitatively Measure human time with lab experiment (user study) Data/task abstraction

problem-driven work 


8

slide-9
SLIDE 9

Framework

System

EgoNetCloud

What: Data

Event-based egocentric dynamic network data

Why: Tasks

Identify clusters, values, trends

How: Encode

Nodes linked with connections; size; category colors;

How: Reduce

Edge pruning; node compression; graph filtering

How: Manipulate

Select

How: Facet

NetCloud; EgoCloud; Static Ego Network

9

slide-10
SLIDE 10

How

10

slide-11
SLIDE 11

Edge Pruning

  • remove low-weight edges

11

prune as many edges as possible retain important edges preserve the connectivity smallest connected maximum weighted spanning graph

slide-12
SLIDE 12
  • authors not listed in alphabetical order
  • sparse matrix
  • cosine similarity as weight
  • recency based scaling: inverse of paper’s age
  • author ordering based scaling
  • authors listed in alphabetical order
  • credit allocation algorithm


[Shen, H. W., & Barabási, A. L. (2014). Collective credit allocation in science. Proceedings of the National Academy of Sciences, 111(34), 12325-12330.]

12

slide-13
SLIDE 13

Node Compression

  • group nodes with the same or similar

connection pattern

  • graph adjacency matrix
  • merge nodes with exactly the same

connectivity

  • merge nodes with the same connectivity and

linked to each other

  • fuzzy compression

1 1 1

13

slide-14
SLIDE 14

Graph Filtering

  • reduce nodes and related edges by rule-based policy
  • importance degree
  • time period
  • # citations
  • # collaborations
  • # publications

14

slide-15
SLIDE 15

Layout Algorithm

  • initial layout
  • alter’s interaction time & frequency with ego
  • constrained stress majorization approach
  • deal with position constraints

15

slide-16
SLIDE 16

EgoNetCloud

16

slide-17
SLIDE 17

17

slide-18
SLIDE 18

18

slide-19
SLIDE 19

19

slide-20
SLIDE 20

Case Study

20

slide-21
SLIDE 21

User Study

  • temporal information related
  • the egocentric network related
  • a combination of the two

21

slide-22
SLIDE 22

Critique

  • suspicious about result of weighted graphs
  • nodes compression algorithm for unweighted graphs
  • “no edge in the complement of the simplified

subgraph has weight greater than any of the edges in this subgraph”

  • efficiency should be 1
  • can’t see the particular benefit


apply to other networks

22

slide-23
SLIDE 23

Questions

23