Non-linear Dimensionality Reduction by Locally Linear Isomaps
Lists
Only you see this
Abstract
Algorithms for nonlinear dimensionality reduction (NLDR) find meaningful hidden low-dimensional structures in a high-dimensional space. Current algorithms for NLDR are Isomaps, Local Linear Embedding and Laplacian Eigenmaps. Isomaps are able to reliably recover low-dimensional nonlinear structures in high-dimensional data sets, but suffer from the problem of short-circuiting, which occurs when the neighborhood distance is larger than the distance between the folds in the manifolds. We propose a new variant of Isomap algorithm based on local linear properties of manifolds to increase its robustness to short-circuiting. We demonstrate that the proposed algorithm works better than Isomap algorithm for normal, noisy and sparse data sets.
BibTeX
@inproceedings{saxena2004non,
author = {Ashutosh Saxena and Abhinav Gupta and Amitabha Mukerjee},
title = {{Non-linear Dimensionality Reduction by Locally Linear Isomaps}},
booktitle = {ICONIP},
year = {2004},
url = {https://openreview.net/forum?id=jQDFuDFgMmN},
}Loading related content...