Think globally, fit locally: unsupervised learning of low dimensional manifolds
The Journal of Machine Learning Research
Robust locally linear embedding
Pattern Recognition
On kernel difference-weighted k-nearest neighbor classification
Pattern Analysis & Applications - Special Issue: Non-parametric distance-based classification techniques and their applications
Local relative transformation with application to isometric embedding
Pattern Recognition Letters
Weighted locally linear embedding for dimension reduction
Pattern Recognition
Clustering-based nonlinear dimensionality reduction on manifold
PRICAI'06 Proceedings of the 9th Pacific Rim international conference on Artificial intelligence
Efficient Parallel Algorithm for Nonlinear Dimensionality Reduction on GPU
GRC '10 Proceedings of the 2010 IEEE International Conference on Granular Computing
Hi-index | 0.00 |
LLE(Local linear embedding) and Isomap are widely used approaches for dimension reduction. For LLE, the neighborhood selection approach is an important research issue. For different types of datasets, we need different neighborhood selection approaches to have better chance for finding reasonable representation within the required number of dimensions. In this paper, the ε-distance approach and a modified version of k-nn method are introduced. For LLE and Isomap, the eigenvectors obtained from these methods are much more discussed, but there are more information hidden in the corresponding eigenvalues which can be used for finding embeddings contains more data information.