Adaptive Manifold Learning
Abstract
Recently, there have been several advances in the machine learning and pattern recognition communities for developing manifold learning algo- rithms to construct nonlinear low-dimensional manifolds from sample data points embedded in high-dimensional spaces. In this paper, we de- velop algorithms that address two key issues in manifold learning: 1) the adaptive selection of the neighborhood sizes; and 2) better fitting the local geometric structure to account for the variations in the curvature of the manifold and its interplay with the sampling density of the data set. We also illustrate the effectiveness of our methods on some synthetic data sets.
Cite
Text
Wang et al. "Adaptive Manifold Learning." Neural Information Processing Systems, 2004.Markdown
[Wang et al. "Adaptive Manifold Learning." Neural Information Processing Systems, 2004.](https://mlanthology.org/neurips/2004/wang2004neurips-adaptive/)BibTeX
@inproceedings{wang2004neurips-adaptive,
title = {{Adaptive Manifold Learning}},
author = {Wang, Jing and Zhang, Zhenyue and Zha, Hongyuan},
booktitle = {Neural Information Processing Systems},
year = {2004},
pages = {1473-1480},
url = {https://mlanthology.org/neurips/2004/wang2004neurips-adaptive/}
}