Tracing Tuples Across Dimensions: A Comparison of Scatterplots and Parallel Coordinate Plots
1. Tracing Tuples Across Dimensions
A Comparison of Scatterplots and Parallel Coordinate Plots
Xiaole Kuang (Master student, NUS)
Haimo Zhang (PhD student, NUS)
Shengdong (Shen) Zhao (Faculty member, NUS)
Michael J. McGuffin
1
(Faculty member,
École de technologie supérieure)
2. 2
The Last Talk of
The Last Session of
The Last Day!
Welcome to
6. Why PCP vs. SCP?
Both techniques are popular!
Yet, we know very little about their comparative
advantages.
6
Viau et al., TVGC10
Yuan et al., TVGC09
Claessen & van Wijk, TVGC11
We need more systematic evaluations
between PCP & SCP!
7. Basics of Evaluation
Research question
• What’s the comparative advantages between
PCP & SCP for certain tasks?
Task
Independent variables
Dependent variables
7
8. Basics of Evaluation
Research question
• What’s the comparative advantages between
PCP & SCP for certain tasks?
Task
Independent variables
Dependent variables
8
9. Basic Analytical Tasks
9
serves as a subtask for many other tasks
Amar et al.: Low-level components of analytic activity in information
visualization. InfoVis05, 111–117.
(Holten & van Wijk, EuroVis10)
(Li et al., InfoVis10)
PCP is inferior than SCP
10. Value Retrieval Task
Definition:
• Given the numerical value of one attribute of a
data tuple, find the numerical value of another
attribute of the same data tuple.
10
Multi-Variate Data Tuple (X1, X2, X3, …. , Xn)
a ?
11. Basics of Evaluation
Research question
• What’s the comparative advantages between
PCP & SCP for certain tasks?
Task
Independent variables
Dependent variables
11
25. Experiment 2
× 18 participants
× 2 techniques (PCP, SCP-common)
× 3 dimensions (4D, 6D, 8D) [2D, 4D, 6D in Exp. 1]
× 3 densities (20 tuples, 30 tuples, 40 tuples)
[10, 20, 30 in Exp. 1]
× 5 trials for each combination
= 1620 trials in total.
25
26. Results – Completion Time
26
Overall result for Exp. 2
SCP-common (15.41s)
PCP (18.23s)
Result in Exp. 1
SCP-common (12.02s)
PCP (8.99s)
faster
faster
Trade-off between number of dimensions& data density
Dimension Density
27. Results – Error Distance
27
Trade-off between number of dimensions& data density
Dimension Density
28. Take-away Lessons
The value retrieval performance
of PCP increases depending on
dimensionality.
The performance of SCP-
common seems independent of
dimensionality.
Increasing density affects the
performance of PCP more
than it affects SCP-common.
28
Dimension
Density
29. Let’s Recap the Take Away-
Messages and Ask Why
1) Both SCP-rotate and SCP-staircase are inferior
for value retrieval task
29
30. Let’s Recap the Take Away
Messages
2) Performance trade-off
between PCP & SCP-common
for both dimensionalities and
data density.
• PCP increases depending on
dimensionality.
• SCP-common performance
seems to be independent.
30
31. Let’s Recap the Take Away
Messages
31
10 tuples
40 tuples
2) Performance trade-off
between PCP & SCP-common
for both dimensionalities and
data density.
• PCP increases depending on
dimensionality.
• SCP-common performance
seems to be independent.
• Increasing density affects
the performance of PCP
more than it affects SCP-
common.
32. Conclusion and Future Work
Our study helps to understand the comparative
advantages between PCP & SCP
However, this is only a starting point,
32
33. The Grand Vision
Ideally, this problem can be solved by …
33
InfoVis
evaluation
package
Results/
Recommendations
34. Acknowledgment
This research is supported by:
The National University of Singapore Academic
Research Fund R-252-000-375-133
and by:
The Singapore National Research Foundation
under its International Research Centre @
Singapore Funding Initiative and administered by
the IDM Programme Office.
35. Q & A
35
Elastic Hierarchy
(InfoVis ‘05)
Tracing Tuples Across Dimensions
(EuroVis ‘12)
Good morning, my name is Shengdong Zhao, you can call me Shen. I am an Assistant Professor of the National University of Singapore. It’s my pleasure here to present the joint work with two of my students (Xiaole and Haimo), and my colleague and friend, professor Michael McGuffin from ETS, Montreal Canada.
Before I start, there are a number of interesting facts I want to share with you.
First, do you know that this is the last talk of the last session on the last day? I have been to quite a few conferences by now, and this is the first time I have been this lucky. I feel like winning a lottery today .
Second, this is the Euro (accent) Vis 2012? But I am from the NUS-HCI lab of National University of Singapore, which is located in Asia. Looking at the map, Vienna is located at this corner, while Singapore is located at the other corner. They are just apart by about 10 thousand km. So why am I here?
Third, my lab, the NUS-HCI mainly worked on HCI project at ACM CHI community, we did some infoVis in the past, as the Elastic Hierarchy project I did a long time ago in InfoVis 05, but InfoVis is not the main focus of our lab, so what motivates me to come to EuroVis today? Well, it is because I have a vision I hope to see in the infoVis community
So what are the two visualization of
This makes us to think of the question: how can we compare the two different techniques in a systematic way?
So what kind of systematic evaluation. We first need to define the typical tasks for these two visualizations, and for that we look into Amar et al.’s paper in 2005.
Number of dimension is somewhat straight-forward, but data density can have a large range, so we need to determine what range need to be used.