UNITED STATES
An Adaptive Neighborhood Graph for LLE Algorithm without Free-Parameter
|
10.5120/1984-2673 |
Xianlin Zou, Qingsheng Zhu and Yifu Jin. Article: An Adaptive Neighborhood Graph for LLE Algorithm without Free-Parameter. International Journal of Computer Applications 16(2):20–23, February 2011. Published by Foundation of Computer Science. BibTeX
@article{key:article,
author = {Xianlin Zou and Qingsheng Zhu and Yifu Jin},
title = {Article: An Adaptive Neighborhood Graph for LLE Algorithm without Free-Parameter},
journal = {International Journal of Computer Applications},
year = {2011},
volume = {16},
number = {2},
pages = {20--23},
month = {February},
note = {Published by Foundation of Computer Science}
}
Abstract
Locally Linear Embedding (LLE) algorithm is the first classic nonlinear manifold learning algorithm based on the local structure information about the data set, which aims at finding the low-dimension intrinsic structure lie in high dimensional data space for the purpose of dimensionality reduction. One deficiency appeared in this algorithm is that it requires users to give a free parameter k which indicates the number of nearest neighbors and closely relates to the success of unfolding the true intrinsic structure. Here, we present an adaptive neighborhood graph with respect to LLE algorithm for learning an adaptive local infrastructure in order to avoid the problem of how to automatically choosing nearest neighbors existed in manifold learning by making use of a novel concept: natural nearest neighbor (3N). Experiment results show that LLE algorithm without free parameter performs more practical and simple algorithm than LLE.
Reference
- J. Tenenbaum, V De Silva and J. C. Langford. A global geometric framework for nonlinear dimension reduction. Science, 290:2319–2323, 2000.
- M. Berstein, V de Silva, J. Langford and J. Tenenbaum. Graph approximations to geodesics on embedded manifolds. http://isomap.stanford.edu/BdSLT.pdf, 2000.
- S. Roweis and L. Saul. Nonlinear dimensionality reduction by locally linear embedding. Science, 290: 2323–2326, 2000.
- L. Saul and S. Roweis, Think Globally, Fit Locally: Unsupervised Learning of Low Dimensional Manifolds. Journal of Machine Learning Research 4 (2003) 119-155.
- M. Belkin and P. Niyogi, Laplacian eigenmaps for dimensionality reduction and data representation. Neural Computation, 15(6):1373–1396, June 2003
- Z. Zhang, H. Zha, Principal manifolds and nonlinear dimensionality reduction via tangent space alignment, SIAM J. Sci. Comput. 26 (1)(2004) 313–338
- X. He, D. Cai, S. Yan, H. Zhang, Neighborhood preserving embedding, in: Proceedings of the 10 IEEE International Conference on Computer Vision, Beijing, China, October 2005, pp. 1208–1213.
- G.Hinton, S. Roweis. Stochastic Neighbor Embedding. Advances in Neural Information Processing Systems 15 (NIPS'02). pp. 857--864
- X. He, P. Niyogi, Locality Preserving Projections, Proceedings of Advances in Neural Information Processing Systems. Cambridge:MIT Press, 2004: 153-160.
- Tony Lin, Hongbin Zha, and Sang Uk Lee. Riemannian Manifold Learning for Nonlinear Dimensionality Reduction. in ECCV 2006, A. Leonardis, H. Bischof, and A. Prinz (Eds.): Part I, LNCS 3951, pp. 44-55, 2006. Springer-Verlag Berlin Heidelberg 2006.
- M. Balasubramanian and E. L. Schwartz, The Isomap Algorithm and Topological Stability. Science, 295, 7a(2002).
- J. Tenenbaum, V De Silva and J. C. Langford, The isomap algorithm and topological stability--response, Science 295, 7a (2002).
