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
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
Qingsong Liu, Yifan Hu, Lei Shi, Xinzhu Mu, Yutao Zhang, Jie Tang IEEE VIS 2015
Presented by: Dylan
1
discrete time point continuous time period
time set
activation time
2
discrete time point (continuous time period) of the edge is associated with an event
be seen as event-based
sending a mobile short message
3
4
5
nodes
layout constraint
6
networks into smaller but more informative abstractions
and explore both the egocentric network structure and their temporal dynamics
world case study
7
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
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
10
11
prune as many edges as possible retain important edges preserve the connectivity smallest connected maximum weighted spanning graph
[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
connection pattern
connectivity
linked to each other
1 1 1
13
14
15
16
17
18
19
20
21
subgraph has weight greater than any of the edges in this subgraph”
apply to other networks
22
23