Self-organizing maps
Nonlinear component analysis as a kernel eigenvalue problem
Neural Computation
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
Vector Quantization and Projection Neural Network
IWANN '93 Proceedings of the International Workshop on Artificial Neural Networks: New Trends in Neural Computation
Laplacian Eigenmaps for dimensionality reduction and data representation
Neural Computation
Think globally, fit locally: unsupervised learning of low dimensional manifolds
The Journal of Machine Learning Research
Learning a kernel matrix for nonlinear dimensionality reduction
ICML '04 Proceedings of the twenty-first international conference on Machine learning
Unsupervised Learning of Image Manifolds by Semidefinite Programming
International Journal of Computer Vision
Local multidimensional scaling
Neural Networks - 2006 Special issue: Advances in self-organizing maps--WSOM'05
A Nonlinear Mapping for Data Structure Analysis
IEEE Transactions on Computers
Nonlinear Dimensionality Reduction
Nonlinear Dimensionality Reduction
Curvilinear component analysis: a self-organizing neural network for nonlinear mapping of data sets
IEEE Transactions on Neural Networks
Topology preservation in self-organizing feature maps: exact definition and measurement
IEEE Transactions on Neural Networks
Quantifying the neighborhood preservation of self-organizing feature maps
IEEE Transactions on Neural Networks
Artificial neural networks for feature extraction and multivariate data projection
IEEE Transactions on Neural Networks
Simbed: Similarity-Based Embedding
ICANN '09 Proceedings of the 19th International Conference on Artificial Neural Networks: Part II
Regularization parameter choice in locally linear embedding
Neurocomputing
Scale-independent quality criteria for dimensionality reduction
Pattern Recognition Letters
Relational generative topographic mapping
Neurocomputing
Relevance learning in generative topographic mapping
Neurocomputing
Subspace mapping of noisy text documents
Canadian AI'11 Proceedings of the 24th Canadian conference on Advances in artificial intelligence
A general framework for dimensionality reduction for large data sets
WSOM'11 Proceedings of the 8th international conference on Advances in self-organizing maps
Extending Sammon mapping with Bregman divergences
Information Sciences: an International Journal
A general framework for dimensionality-reducing data visualization mapping
Neural Computation
A survey on unsupervised outlier detection in high-dimensional numerical data
Statistical Analysis and Data Mining
Incorporating visualisation quality measures to curvilinear component analysis
Information Sciences: an International Journal
A particle swarm embedding algorithm for nonlinear dimensionality reduction
ANTS'12 Proceedings of the 8th international conference on Swarm Intelligence
Unsupervised nearest neighbors with kernels
KI'12 Proceedings of the 35th Annual German conference on Advances in Artificial Intelligence
How to quantitatively compare data dissimilarities for unsupervised machine learning?
ANNPR'12 Proceedings of the 5th INNS IAPR TC 3 GIRPR conference on Artificial Neural Networks in Pattern Recognition
Discriminative dimensionality reduction mappings
IDA'12 Proceedings of the 11th international conference on Advances in Intelligent Data Analysis
Visualizing the quality of dimensionality reduction
Neurocomputing
Artificial Intelligence in Medicine
Hi-index | 0.01 |
Dimensionality reduction aims at providing low-dimensional representations of high-dimensional data sets. Many new nonlinear methods have been proposed for the last years, yet the question of their assessment and comparison remains open. This paper first reviews some of the existing quality measures that are based on distance ranking and K-ary neighborhoods. Next, the definition of the co-ranking matrix provides a tool for comparing the ranks in the initial data set and some low-dimensional embedding. Rank errors and concepts such as neighborhood intrusions and extrusions can then be associated with different blocks of the co-ranking matrix. Several quality criteria can be cast within this unifying framework; they are shown to involve one or several of these characteristic blocks. Following this line, simple criteria are proposed, which quantify two aspects of the embedding quality, namely its overall quality and its tendency to favor intrusions or extrusions. They are applied to several recent dimensionality reduction methods in two experiments, with both artificial and real data.