Algorithm for interactive forming matrix data representation and estimation of its efficiency
Pattern Recognition Letters
A computer generated aid for cluster analysis
Communications of the ACM
Designing Pixel-Oriented Visualization Techniques: Theory and Applications
IEEE Transactions on Visualization and Computer Graphics
Information-theoretic co-clustering
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Towards parameter-free data mining
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
The Grammar of Graphics (Statistics and Computing)
The Grammar of Graphics (Statistics and Computing)
IEEE Transactions on Visualization and Computer Graphics
Parallel Sets: Interactive Exploration and Visual Analysis of Categorical Data
IEEE Transactions on Visualization and Computer Graphics
Evaluating visual table data understanding
Proceedings of the 2006 AVI workshop on BEyond time and errors: novel evaluation methods for information visualization
MatrixExplorer: a Dual-Representation System to Explore Social Networks
IEEE Transactions on Visualization and Computer Graphics
On data mining, compression, and Kolmogorov complexity
Data Mining and Knowledge Discovery
NodeTrix: a Hybrid Visualization of Social Networks
IEEE Transactions on Visualization and Computer Graphics
Seriation and matrix reordering methods: An historical overview
Statistical Analysis and Data Mining
Scalable pixel based visual data exploration
VIEW'06 Proceedings of the 1st first visual information expert conference on Pixelization paradigm
Spatial autocorrelation-based information visualization evaluation
Proceedings of the 2012 BELIV Workshop: Beyond Time and Errors - Novel Evaluation Methods for Visualization
Hi-index | 0.00 |
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.