skip to main content
10.1145/2669557.2669566acmotherconferencesArticle/Chapter ViewAbstractPublication PageschiConference Proceedingsconference-collections
research-article

More bang for your research buck: toward recommender systems for visual analytics

Published: 10 November 2014 Publication History

Abstract

We propose a set of common sense steps required to develop a recommender system for visual analytics. Such a system is an essential way to get additional mileage out of costly user studies, which are typically archived post publication. Crucially, we propose conducting user studies in a manner that allows machine learning techniques to elucidate relationships between experimental data (i.e., user performance) and metrics about the data being visualized and candidate visual representations. We execute a case study within our framework to extract simple rules of thumb that relate different data metrics and visualization characteristics to patterns of user errors on several network analysis tasks. Our case study suggests a research agenda supporting the development of general, robust visualization recommender systems.

References

[1]
A.-L. Barabási and R. Albert. Emergence of scaling in random networks. Science, 286(5439):509--512, 1999.
[2]
G. Csardi and T. Nepusz. The igraph software package for complex network research. InterJournal, Complex Systems:1695, 2006. URL http://igraph.org.
[3]
A. Dasgupta and R. Kosara. Pargnostics: Screen-space metrics for parallel coordinates. IEEE Transactions on Visualization and Computer Graphics, 16(6):1017--1026, 2010.
[4]
J. Demšar, T. Curk, A. Erjavec, Črt Gorup, T. Hočevar, M. Milutinovič, M. Možina, M. Polajnar, M. Toplak, A. Starič, M. Štajdohar, L. Umek, L. Žagar, J. Žbontar, M. Žitnik, and B. Zupan. Orange: Data mining toolbox in python. Journal of Machine Learning Research, 14: 2349--2353, 2013.
[5]
P. Erdös and A. Rényi. On random graphs I. Publicationes Mathematicae, 6:290--297, 1959.
[6]
T. M. Fruchterman and E. M. Reingold. Graph drawing by force-directed placement. Software: Practice and Experience, 21(11):1129--1164, 1991.
[7]
M. Ghoniem, J. Fekete, and P. Castagliola. A comparison of the readability of graphs using node-link and matrix-based representations. IEEE Symposium on Information Visualization, pages 17--24, 2004.
[8]
H. Goodell, C.-H. Chiang, C. Kelleher, A. Baumann, and G. Grinstein. Metrics for analyzing rich session histories. Proceedings of the 2006 AVI Workshop on BEyond Time and Errors: Novel Evaluation Methods for Information Visualization, pages 35--40, 2006.
[9]
T. M. Green, W. Ribarsky, and B. Fisher. Building and applying a human cognition model for visual analytics. Information Visualization, 8(1):1--13, 2009.
[10]
P. Holme and B. J. Kim. Growing scale-free networks with tunable clustering. Physical Review E, 65(2): 026107, 2002.
[11]
T. Kamada and S. Kawai. An algorithm for drawing general undirected graphs. Information Processing Letters, 31(1):7--15, 1989.
[12]
J. H. Kim and V. H. Vu. Generating random regular graphs. Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing, pages 213--222, 2003.
[13]
B. Lee, C. Plaisant, C. S. Parr, J.-D. Fekete, and N. Henry. Task taxonomy for graph visualization. Proceedings of the 2006 AVI Workshop on BEyond Time and Errors: Novel Evaluation Methods for Information Visualization, pages 59--63, 2006.
[14]
R. E. Patterson, L. M. Blaha, G. G. Grinstein, K. K. Liggett, D. E. Kaveney, K. C. Sheldon, P. R. Havig, and J. A. Moore. A human cognition framework for information visualization. Computers & Graphics, 42: 42--58, 2014.
[15]
H. C. Purchase. The effects of graph layout. Proceedings of the Australasian Computer Human Interaction Conference, pages 80--86, 1998.
[16]
H. C. Purchase, R. F. Cohen, and M. I. James. An experimental study of the basis for graph drawing algorithms. Journal of Experimental Algorithmics, 2:4, 1997.
[17]
B. Shneiderman. The eyes have it: A task by data type taxonomy for information visualizations. IEEE Symposium on Visual Languages, pages 336--343, 1996.
[18]
A. Steger and N. C. Wormald. Generating random regular graphs quickly. Combinatorics, Probability and Computing, 8(04):377--396, 1999.
[19]
K. Sugiyama, S. Tagawa, and M. Toda. Methods for visual understanding of hierarchical system structures. IEEE Transactions on Systems, Man and Cybernetics, 11(2):109--125, 1981.
[20]
C. Ware, H. Purchase, L. Colpoys, and M. McGill. Cognitive measurements of graph aesthetics. Information Visualization, 1(2):103--110, 2002.
[21]
S. Wasserman and K. Faust. Social Network Analysis: Methods and Applications, volume 8. Cambridge University Press, 1994.
[22]
D. J. Watts and S. H. Strogatz. Collective dynamics of 'small-world' networks. Nature, 393(6684):440--442, 1998.
[23]
S. Wehrend and C. Lewis. A problem-oriented classification of visualization techniques. Proceedings of the 1st Conference on Visualization '90, pages 139--143, 1990.
[24]
L. Wilkinson, A. Anand, and R. L. Grossman. Graph-theoretic scagnostics. IEEE Symposium on Information Visualization, 5:157--164, 2005.
[25]
J. M. Wolfe. What can 1 million trials tell us about visual search? Psychological Science, 9(1):33--39, 1998.
[26]
W. W. Zachary. An information flow model for conflict and fission in small groups. Journal of Anthropological Research, 33:452--473, 1977.

Cited By

View all
  • (2016)SeekAView: An intelligent dimensionality reduction strategy for navigating high-dimensional data spaces2016 IEEE 6th Symposium on Large Data Analysis and Visualization (LDAV)10.1109/LDAV.2016.7874305(11-19)Online publication date: Oct-2016

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences
BELIV '14: Proceedings of the Fifth Workshop on Beyond Time and Errors: Novel Evaluation Methods for Visualization
November 2014
184 pages
ISBN:9781450332095
DOI:10.1145/2669557
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 10 November 2014

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. human performance evaluation
  2. information visualization
  3. social network analysis
  4. visual analytics

Qualifiers

  • Research-article

Conference

BELIV '14

Acceptance Rates

BELIV '14 Paper Acceptance Rate 23 of 30 submissions, 77%;
Overall Acceptance Rate 45 of 64 submissions, 70%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)8
  • Downloads (Last 6 weeks)0
Reflects downloads up to 25 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2016)SeekAView: An intelligent dimensionality reduction strategy for navigating high-dimensional data spaces2016 IEEE 6th Symposium on Large Data Analysis and Visualization (LDAV)10.1109/LDAV.2016.7874305(11-19)Online publication date: Oct-2016

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media