Abstract
Popular nonlinear dimensionality reduction algorithms, e.g., LLE, Isomap and SIE suffer a difficulty in common: neighborhood parameter has to be configured in advance to gain meaningful embedding results. Simulation shows that embedding often loses relevance under improper parameters configures. But current embedding residual criterions of neighborhood parameters selection are not independent to neighborhood parameters. Therefore it cannot work universally. To improve the availability of nonlinear dimensionality reduction algorithms in the field of self-adaptive machine learning, it is necessary to find some transcendent criterions to achieve unsupervised parameters selection. This paper begins with a discussion of optimal embedding principles and proposes a statistics based on spatial mutual information and normalized dependency index spectrum to determine reasonable parameters configuration. The simulation supports our proposal effectively.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Barlow, H.: Unsupervised learning. Neural Computation 1, 295–311 (1989)
Marcus, G.: Programs of the Mind. Science 304, 1450–1451
Baum, E.: What Is Thought? MIT Press, Cambridge, MA (2004)
Mardia, K.V., Kent, J.T., Bibby, J.M.: Multivariate Analysis. Academic Press, London (1979)
Tenenbaum, J.B., et al.: A Global Geometric Framework for Nonlinear Dimensionality Reduction. Science 290, 2319–2323 (2000)
Roweis, S.T., et al.: Nonlinear Dimensionality Reduction by Locally Linear Embedding. Science 290, 2323–2326 (2000)
De Silva, V., Tenenbaum, J.: Global versus local methods in nonlinear dimensionality reduction. In: de Silva, V., et al. (eds.) NIPS 2002 (2002)
Yuexian, H., et al.: Robust Nonlinear dimension reduction: a self-organizing approach. In: FSDK 2005 (2005)
Li, M., Vitanyi, P.M.B.: An Introduction to Kolmogorov Complexity and Its Applications, 2nd edn. Springer, New York (1997)
Ash, R.: Information Theory. John Wiley and Sons Press, Indianapolis (1965)
Tsallis, C.: Possible generalization of Boltzmann-Gibbs statistics. J. Stat. Phys. 52(1/2), 479–487 (1988)
Belkin, M., Niyogi, P.: Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering. In: NIPS 2001 (2001)
Yuexian, H., Pilian, H.: Identification of Neural Network Predictor by Means of Prediction Complexity. Information and control 30(1) (2001)
Balasubramanian, M., Schwartz, E.L.: The ISOMAP algorithm and topological stability. In: Tenenbaum, J.B., de Silva, V., Langford, J.C. (eds.) Science, vol. 295, p. 7a (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yu, R., Hou, Y., He, P. (2006). Self-organizing Isometric Embedding Based on Statistical Criterions. In: Wang, L., Jiao, L., Shi, G., Li, X., Liu, J. (eds) Fuzzy Systems and Knowledge Discovery. FSKD 2006. Lecture Notes in Computer Science(), vol 4223. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11881599_47
Download citation
DOI: https://doi.org/10.1007/11881599_47
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-45916-3
Online ISBN: 978-3-540-45917-0
eBook Packages: Computer ScienceComputer Science (R0)