Laplacian Eigenmaps for dimensionality reduction and data representation
Neural Computation
Learning a kernel matrix for nonlinear dimensionality reduction
ICML '04 Proceedings of the twenty-first international conference on Machine learning
Principal Manifolds and Nonlinear Dimensionality Reduction via Tangent Space Alignment
SIAM Journal on Scientific Computing
A Semi-Supervised Framework for Mapping Data to the Intrinsic Manifold
ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 - Volume 01
Analysis and extension of spectral methods for nonlinear dimensionality reduction
ICML '05 Proceedings of the 22nd international conference on Machine learning
Incremental Nonlinear Dimensionality Reduction by Manifold Learning
IEEE Transactions on Pattern Analysis and Machine Intelligence
Semi-supervised nonlinear dimensionality reduction
ICML '06 Proceedings of the 23rd international conference on Machine learning
Rapid and brief communication: Incremental locally linear embedding
Pattern Recognition
Spline embedding for nonlinear dimensionality reduction
ECML'06 Proceedings of the 17th European conference on Machine Learning
Locally linear online mapping for mining low-dimensional data manifolds
PAKDD'08 Proceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining
Supervisory data alignment for text-independent voice conversion
IEEE Transactions on Audio, Speech, and Language Processing
Hi-index | 0.00 |
In recent years, a series of manifold learning algorithms have been proposed for nonlinear dimensionality reduction (NLDR). Most of them can run in a batch mode for a set of given data points, but lack a mechanism to deal with new data points. Here we propose an extension approach, i.e., embedding new data points into the previously-learned manifold. The core idea of our approach is to propagate the known co-ordinates to each of the new data points. We first formulate this task as a quadratic programming, and then develop an iterative algorithm for coordinate propagation. Smoothing splines are used to yield an initial coordinate for each new data point, according to their local geometrical relations. Experimental results illustrate the validity of our approach.