Module 6 - Complex Idioms Flashcards

1
Q

Why Maps? (V1)

A
  1. Understanding spatial relationships
  2. Familiarity
    * People know where something is on a map
    (assuming they are familiar with the region)
  3. Maps act as an index from spatial to semantic information and vice-versa.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Choropleth map (V1)

A

Data = 1 Quantitative attribute w/ geographic geometry
Mark = Geometric Area
Channel = Color
Tasks = Spatial relationship

*misleading (size of objects depend on geography, not the attribute), cannot compare well
-> resolve by using glyphs
mark = dot/point
channel = size

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Cartogram (V1)

A

a map that distorts such that area represents size/quantity correctly
*distorting and accuracy at the cost familiarity

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Dot Map (V1)

A

Introduce a point that represents observations, and scatter across map

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Density Map (V1)

A

Turn discrete data into continuous data (using KDE) and plot as a heatmap

Can also be 2d, with transparency representing bins

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Topographic Map (V1)

A

Data = Scalar Spatial Field (quantitative continuous data, can interpolate between points) w/ geographic geometry
Mark = Lines,
Channel = Shape, Position Color
Tasks = Spatial Relationship

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Caution with Maps (V1)

A

A dataset may contain geographical information
* Yet creating a geographical visualization may not be
relevant.
* Ask: “does spatial arrangement matter for my task?”
* Position most effective visual channel  do not waste
it, if not relevant.

Absolute vs Relative

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Network (V2)

A

Describe the relationship between objects
represented as tuples of verticies and edges
- Undirected OR Directed

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Tree (V2)

A

Special type of network that has hierachy
- a graph without cycles (acyclic) and has one root
- nodes have 0 or more children

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Types of Static Networks (Design) (V2)

A

Types (Design choices for arrangement):
1. Node-link diagram (both)
2. Adjacency Matrix (both)
3. Enclosure (does not represent network, only tree)

Structure is important, shows areas of interest

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Types of Network Structure (V2)

A
  1. Radial
    - hides a lot of info, structure depends on ordering of nodes
  2. Arc
    - edges move clockwise. top are left to right, bottom right to left
    - linearise nodes! (sort/ordering)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Layout/Embedding (V2)

A

Positioning of nodes

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Things to do when Visualising a Static Network (V2)

A
  1. Maximise Readability & aesthetics
    * Equal edge length
    * Minimize crossings
    * Non-overlapping nodes
    * High-degree nodes should have a central position
    * Symmetry should be maximized
    * Communities should be clearly visible
  2. Optimise structure using node force directed algorithms
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Issues caused by Large Networks, Solution? (V3)

A

Methods used to visualise static network do not apply, as there is too much data -> hairball visualisation

Use other attributes from data such as Hierachy (from data OR computed) and node+edges Force directed algorithms to give structure

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Visual Adjacency Matrix for Large Networks (V3)

A
  1. More scalable compared to node link diagram
    Use color (transparency) to denote weight of edges
  2. Maximise edge visibility

*no crossings, cannot find paths easily
*ordering of nodes is important

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

How to get good ordering for Visual Adjacency Matrix, for Large Networks (V3)

A

Additional Hierachal Data (from data OR computed) (hieracheral clustering)

17
Q

Which (design) choice of networks is used for Trees? (V4)

A
  1. Node Link diagram
  2. Enclosure
    (can combine both methods into one visualisation)

adjacency matrix is hardly used due to the structure of the tree, data will be very sparse

18
Q

Nodelink Diagrams for Trees (V4)

A

standard node-link diagram wastes a lot of space, instead use radial layout (root node in middle)

if tree is very big, use hyperbolic technique

19
Q

Enclosure Diagrams for Trees (V4)

A
  1. Venn Diagram,
  2. Treemap
  3. Nested Treemap
20
Q

Treemap VS Nodelink (V4)

A

Treemap:
+ scalability is milions of items, better then node link. limit is screen resolution
+ Good usage of Space
- Hierachy/order is implicit (not shown directly)

Node-link
+ intuitive
+ good at exposing structure of information
- empty space

21
Q

Treemap Space Filling Techniques (V4)

A

Slice and Dice Layout:
* leads to very long/elongated rectangles (due to switching between vertical and horizontal cuts),
use Squarified Layout instead:
* however, comparison between dynamic hierachy is impossible

22
Q

Dynamic Networks (V5)

A

Networks that change over time
- edge is represented by vertices AND time-stampP

23
Q

Properties of Dynamic Networks (V5)

A

Structural Properties:
- communities
- motifs

Temporal Properties:
- Trends
- Anomalies
- Periodicity
- Temporal Shifts

24
Q

Understanding Dynamic Networks (V5)

A

Discovering/Exploring states
* Characterizing the evolution of
the network
* Stable states, recurring states,
outlier states
* Transitions between them

25
Q

Methods to visualise Dynamic Networks (V5)

A
  1. Animation (mapping time to time)
  2. Small Multiples (mapping time in intervals)
  3. Integrated approach (mapping time to space)
26
Q

Animation to Dynamic Networks (V5)

A

for each time stamp, compute layout -> show changes

+ easy to implement
+ easy to spot big changes
+ applicable to all methods that a time stamp can be visualised

  • need to focus on many moving items simultaneously
  • keep track of multiple changes over time (relying on user memory)
  • change blindess (cannot see small changes)

use:
- preservation of the mental map (keep variation between layouts as small as possible)
- add timeline control

27
Q

Small Multiples to Dynamic Networks (V5)

A

Juxtaposed visualisation using filmstrip or a grid layout

+ Can be used for any dynamic network

  • Decide on number of multiples used (too many = hard to spot changes, too little = can’t see change)
28
Q

Integrated Approach (Mapping time to space) to Dynamic Networks (V5)

A

Provide static overview of entire time span of network in one visualisation

+ Complete overview
+ Global patterns are easily identified

  • Specialised Visual encoding, difficult to interpret for non experts
  • Restricted to specialised type of network
29
Q

Examples of Integrated Approach (Mapping time to space) (V5)

A

Clusters over time (Individual nodes and edges not visible anymore)
Massive Sequence View (ordering is important)
Parallel Edge Splatting (needs interaction)

30
Q

Idioms for Time-Series Data

A

Line Chart, Streamgraph

Connected Scatterplot:
same as normal scatterplot, but have multiple points connected using directed lines to show temporal ordering

Gantt Chart:
Data = 1 Categorical Attribute (Key), 2 Quantitative Attributes
Mark = Line
Channel = Horizontal position (start position), Length (duration)
Tasks = Temporal Overlaps, dependencies between categories