Cluster Stability and the Use of Noise in Interpretation of Clustering
INFOVIS '01 Proceedings of the IEEE Symposium on Information Visualization 2001 (INFOVIS'01)
A Hybrid Layout Algorithm for Sub-Quadratic Multidimensional Scaling
INFOVIS '02 Proceedings of the IEEE Symposium on Information Visualization (InfoVis'02)
ACE: A Fast Multiscale Eigenvectors Computation for Drawing Huge Graphs
INFOVIS '02 Proceedings of the IEEE Symposium on Information Visualization (InfoVis'02)
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Visualising changes in fund manager holdings in two and a half-dimensions
Information Visualization
Journal of Biomedical Informatics
Proceedings of the International Conference on Advanced Visual Interfaces
Reconstructing surfaces of particle-based fluids using anisotropic kernels
Proceedings of the 2010 ACM SIGGRAPH/Eurographics Symposium on Computer Animation
Graph drawing by subspace optimization
VISSYM'04 Proceedings of the Sixth Joint Eurographics - IEEE TCVG conference on Visualization
Reconstructing surfaces of particle-based fluids using anisotropic kernels
ACM Transactions on Graphics (TOG)
Representation of protein secondary structure using bond-orientational order parameters
PRIB'12 Proceedings of the 7th IAPR international conference on Pattern Recognition in Bioinformatics
Graph drawing by classical multidimensional scaling: new perspectives
GD'12 Proceedings of the 20th international conference on Graph Drawing
Hi-index | 0.00 |
We present a novel family of data-driven linear transformations, aimed at visualizing multivariate data in a low-dimensional space in a way that optimally preserves the structure of the data. The well-studied PCA and Fisher's LDA are shown to be special members in this family of transformations, and we demonstrate how to generalize these two methods such as to enhance their performance. Furthermore, our technique is the only one, to the best of our knowledge, that reflects in the resulting embedding both the data coordinates and pairwise similarities and/or dissimilarities between the data elements. Even more so, when information on the clustering (labeling) decomposition of the data is known, this information can be integrated in the linear transformation, resulting in embeddings that clearly show the separation between the clusters, as well as their intra-structure. All this make our technique very flexible and powerful, and let us cope with kinds of data that other techniques fail to describe properly.