Innar Liiv
ABSTRACT
This paper presents a discussion about matrix-based representation evaluation measures, including a review of related evaluation measures from different scientific disciplines and a proposal for promising approaches. The paper advocates linking or replacing a large portion of indefinable aesthetics with a mathematical framework and theory backed up by an incomputable function -- Kolmogorov complexity. A suitable information-theoretic evaluation measure is proposed together with a practical approximating implementation example for Bertin's Matrices.
- Ghoniem, M., Fekete, J., and Castagliola, P. 2005. On the readability of graphs using node-link and matrix-based representations: a controlled experiment and statistical analysis. Information Visualization 4, 2, 114--135. Google Scholar
Digital Library
- Henry, N. and Fekete, J., & McGuffin, M. J. 2007. NodeTrix: a Hybrid Visualization of Social Networks. IEEE Transactions on Visualization and Computer Graphics 13, 6, 1302--1309. Google ScholarDigital Library
- Henry, N. and Fekete, J. 2006. MatrixExplorer: a Dual-Representation System to Explore Social Networks. IEEE Transactions on Visualization and Computer Graphics 12, 5, 677--684. Google ScholarDigital Library
- Katz, L. 1947. On the Matric Analysis of Sociometric Data. Sociometry, 10(3), 233--241.Google ScholarCross Ref
- Forsyth, E., & Katz, L. 1946. A Matrix Approach to the Analysis of Sociometric Data: Preliminary Report. Sociometry, 9(4), 340--347.Google ScholarCross Ref
- Moreno, J. L. 1946. Sociogram and Sociomatrix: A Note to the Paper by Forsyth and Katz. Sociometry, 9(4), 348--349.Google ScholarCross Ref
- Henry, N. and Fekete, J. 2006. Evaluating visual table data understanding. In Proceedings of the 2006 AVI Workshop on Beyond Time and Errors: Novel Evaluation Methods For information Visualization (Venice, Italy, May 23--23, 2006). BELIV '06. ACM, New York, NY, 1--5. Google ScholarDigital Library
- Bertin, J. 1981. Graphics and Graphic Information Processing. Berlin: Walter de Gruyter (Translated by W. J. Berg and P. Scott).Google Scholar
- Bertin, J. 1967. Sémiologie graphique: les diagrammes, les réseaux, les cartes. Paris: Mouton.Google Scholar
- Mueller, C., Martin, B., and Lumsdaine, A. A comparison of vertex ordering algorithms for large graph visualization, In Proceedings of Asia-Pacific Symposium on Visualization 2007, 141--148.Google ScholarCross Ref
- Ling, R. L. 1973. A computer generated aid for cluster analysis. Commun. ACM 16, 6 (Jun. 1973), 355--361. Google ScholarDigital Library
- Liiv, I. "Seriation and Matrix Reordering Methods: An Historical Overview", Statistical Analysis and Data Mining, 2010, in press. Google ScholarCross Ref
- Wilkinson, L. and Friendly, M. 2009. The History of the Cluster Heat Map. The American Statistician, 63(2), 179--184.Google ScholarCross Ref
- Chandrasekharan, M. P., & Rajagopalan, R. 1989. Groupability: an analysis of the properties of binary data for group technology. International Journal of Production Research, 27, 1035--1052.Google ScholarCross Ref
- Kumar, K. R., & Chandrasekharan, M. P. 1990. Group efficacy: a quantitative criterion for goodness of block diagonal forms of binary matrices in group technology. International Journal of Production Research, 28(2), 233--243.Google ScholarCross Ref
- O'Brien, M. J., & Lyman, R. L. 1999. Seriation, Stratigraphy, and Index Fossils: The Backbone of Archaeological Dating. New York: Kluwer Academic/Plenum Publishers.Google Scholar
- Bar-Joseph, Z., Gifford, D. K., & Jaakkola, T. S. 2001. Fast optimal leaf ordering for hierarchical clustering. Bioinformatics, 17(S1), S22--S29.Google ScholarCross Ref
- Bar-Joseph, Z., Demaine, E. D., Gifford, D. K., Srebro, N., Hamel, A. M., & Jaakkola, T. S. 2003. K-ary Clustering with Optimal Leaf Ordering for Gene Expression Data. Bioinformatics, 19(9), 1070--1078.Google ScholarCross Ref
- Verin, L. L., & Grishin, V. G. 1986. Algorithm for interactive forming matrix data representation and estimation of its efficiency. Pattern Recognition Letters, 4, 193--200. Google ScholarDigital Library
- McCormick, W. T., Schweitzer, P. J., & White, T. W. 1972. Problem Decomposition and Data Reorganization by a Clustering Technique. Operations Research, 20(5), 993--1009.Google ScholarDigital Library
- Niermann, S. 2005. Optimizing the Ordering of Tables With Evolutionary Computation. The American Statistician, 59(1), 41--46.Google ScholarCross Ref
- Keim, D. A. 2000. Designing Pixel-Oriented Visualization Techniques: Theory and Applications. IEEE Transactions on Visualization and Computer Graphics 6, 1, 59--78. Google ScholarDigital Library
- Keim, D. A, Schneidewind, J., & Sips, M. 2007. Scalable Pixel-based Visual Data Exploration in "Pixelization Paradigm", Lecture Notes in Computer Science, Vol. 4370, Springer. Google ScholarDigital Library
- Kosara, R, Bendix, F., & Hauser, H. 2006. Parallel Sets: Interactive Exploration and Visual Analysis of Categorical Data. IEEE Transactions on Visualization and Computer Graphics 12, 4, 558--568. Google ScholarDigital Library
- Seo, J., Shneiderman, B. 2006. Knowledge Discovery in High-Dimensional Data: Case Studies and a User Survey for the Rank-by-Feature Framework. IEEE Transactions on Visualization and Computer Graphics 12, 3, 311--322. Google ScholarDigital Library
- Rissanen, J. 1978. Modelling by shortest data description. Automatica, 14, 465--471.Google ScholarDigital Library
- Grünwald, P. D. 2007. The Minimum Description Length Principle. Cambridge, MA: MIT Press.Google Scholar
- Keogh, E., Lonardi, S., & Ratanamahatana, C. A. 2004. Towards Parameter-Free Data Mining. In Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining, Seattle, WA, USA, August 22--25, 2004, 206--215. Google ScholarDigital Library
- Dhillon, I. S., Mallela, S., & Modha, D. S. 2003. Information-Theoretic Co-Clustering. In Proceedings of The Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining(KDD-2003), Washington, DC, USA, August 24--27, 2003, 89--98. Google ScholarDigital Library
- Faloutsos, C., & Megalooikonomou, V. 2007. On data mining, compression, and Kolmogorov. Data Mining and Knowledge Discovery, 15(1), 3--20. Google ScholarDigital Library
- Wilkinson, L. 2005. The Grammar of Graphics (2nd Edition). Springer: New York. Google ScholarDigital Library
Index Terms
- Towards information-theoretic visualization evaluation measure: a practical example for Bertin's matrices
Recommendations
A Model and Framework for Visualization Exploration
Visualization exploration is the process of extracting insight from data via interaction with visual depictions of that data. Visualization exploration is more than presentation; the interaction with both the data and its depiction is as important as ...
Towards Personalized Visualization: Information Granularity, Situation, and Personality
DIS '17: Proceedings of the 2017 Conference on Designing Interactive SystemsTechnology users are collecting data about themselves at an astounding rate. This explosion of data collection has not been matched by users' abilities to assimilate and apply this information. Visualization is a key means of bridging this gap, however, ...
How Information Visualization Novices Construct Visualizations
It remains challenging for information visualization novices to rapidly construct visualizations during exploratory data analysis. We conducted an exploratory laboratory study in which information visualization novices explored fictitious sales data by ...
Comments