Distance-preserving mapping of patterns to 3-space

Authors:
Li Yang
Affiliations:
Department of Computer Science, Western Michigan University, 1903 W Michigan Avenue, Kalamazoo, MI
Venue:
Pattern Recognition Letters
Year:
2004

Citing 6
Cited 0

The grand tour: a tool for viewing multidimensional data

SIAM Journal on Scientific and Statistical Computing
Algorithms for clustering data

Algorithms for clustering data
Self-organizing maps

Self-organizing maps
Statistical Pattern Recognition: A Review

IEEE Transactions on Pattern Analysis and Machine Intelligence
Interactive exploration of very large relational datasets through 3D dynamic projections

Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Curvilinear component analysis: a self-organizing neural network for nonlinear mapping of data sets

IEEE Transactions on Neural Networks

Quantified Score

Hi-index	0.10

Visualization

Abstract

The triangulation method is extended to a tetrahedron method for the distance-preserving mapping of high dimensional data points to 3-space. Each point is mapped so that its distances to three already mapped points are preserved. The choices of these points give a set of ways to display both local and global information. Example applications in pattern analysis are discussed.