An introduction to the Ising model
American Mathematical Monthly
Introduction to algorithms
Enhanced simulated annealing for globally minimizing functions of many-continuous variables
ACM Transactions on Mathematical Software (TOMS)
Solving Sparse Symmetric Sets of Linear Equations by Preconditioned Conjugate Gradients
ACM Transactions on Mathematical Software (TOMS)
A Database for Handwritten Text Recognition Research
IEEE Transactions on Pattern Analysis and Machine Intelligence
Coordinating Principal Component Analyzers
ICANN '02 Proceedings of the International Conference on Artificial Neural Networks
Laplacian Eigenmaps for dimensionality reduction and data representation
Neural Computation
Principal Manifolds and Nonlinear Dimensionality Reduction via Tangent Space Alignment
SIAM Journal on Scientific Computing
Analysis and extension of spectral methods for nonlinear dimensionality reduction
ICML '05 Proceedings of the 22nd 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
Non-isometric manifold learning: analysis and an algorithm
Proceedings of the 24th international conference on Machine learning
Manifold Learning: The Price of Normalization
The Journal of Machine Learning Research
Automatic Choice of the Number of Nearest Neighbors in Locally Linear Embedding
CIARP '09 Proceedings of the 14th Iberoamerican Conference on Pattern Recognition: Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications
Regularization parameter choice in locally linear embedding
Neurocomputing
Automatic configuration of spectral dimensionality reduction methods
Pattern Recognition Letters
Global and local choice of the number of nearest neighbors in locally linear embedding
Pattern Recognition Letters
Parallel vector field embedding
The Journal of Machine Learning Research
Hi-index | 0.00 |
We present the Procrustes measure, a novel measure based on Procrustes rotation that enables quantitative comparison of the output of manifold-based embedding algorithms such as LLE (Roweis and Saul, Science 290(5500), 2323---2326, 2000) and Isomap (Tenenbaum et al., Science 290(5500), 2319---2323, 2000). The measure also serves as a natural tool when choosing dimension-reduction parameters. We also present two novel dimension-reduction techniques that attempt to minimize the suggested measure, and compare the results of these techniques to the results of existing algorithms. Finally, we suggest a simple iterative method that can be used to improve the output of existing algorithms.