Skip to main content

Extensions of Manifold Learning Algorithms in Kernel Feature Space

  • Conference paper
Advances in Neural Networks – ISNN 2007 (ISNN 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4491))

Included in the following conference series:

  • 1351 Accesses

Abstract

Manifold learning algorithms have been proven to be capable of discovering some nonlinear structures. However, it is hard for them to extend to test set directly. In this paper, a simple yet effective extension algorithm called PIE is proposed. Unlike LPP, which is linear in nature, our method is nonlinear. Besides, our method will never suffer from the singularity problem while LPP and KLPP will. Experimental results of data visualization and classification validate the effectiveness of our proposed method.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Tenenbaum, J.B., de Silva, V., Langford, J.C.: A Global Geometric Framework for Nonlinear Dimensionality Reduction. Science 290, 2319–2323 (2000)

    Article  Google Scholar 

  2. Roweis, S.T., Saul, L.K.: Nonlinear Dimensionality Reduction by Locally Linear Embedding. Science 290, 2323–2326 (2000)

    Article  Google Scholar 

  3. Belkin, M., Niyogi, P.: Laplacian Eigenmap and Spectral Techniques for Embedding and Clustering. Advances in Neural Information Processing Systems 14, 585–591 (2001)

    Google Scholar 

  4. He, X., Yan, S., Hu, Y., Niyogi, P., Zhang, H.: Face Recognition Using Laplacianfaces. IEEE Trans. Pattern Analysis and Machine Intelligence 27, 328–340 (2005)

    Article  Google Scholar 

  5. Feng, G., Hu, D., Zhang, D., Zhou, Z.: An Alternative Formulation of Kernel LPP with Application to Image Recognition. Neurocomputing 69, 1733–1738 (2006)

    Article  Google Scholar 

  6. Müller, K.R., Mika, S., Rätsch, G., Tsuda, K., Schölkopf, B.: An Introduction to Kernel-based Learning Algorithms. IEEE Trans. Neural Networks 12, 181–201 (2001)

    Article  Google Scholar 

  7. Golub, G.H., Van Loan, C.F.: Matrix Computations, 3rd edn. Johns Hopkins Univ. Press, Baltimore (1996)

    MATH  Google Scholar 

  8. Haykin, S.: Neural Networks - A Comprehensive Foundation, 2nd edn. Prentice-Hall, Englewood Cliffs (1999)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yu, Y., Guan, P., Zhang, L. (2007). Extensions of Manifold Learning Algorithms in Kernel Feature Space. In: Liu, D., Fei, S., Hou, ZG., Zhang, H., Sun, C. (eds) Advances in Neural Networks – ISNN 2007. ISNN 2007. Lecture Notes in Computer Science, vol 4491. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72383-7_53

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-72383-7_53

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-72382-0

  • Online ISBN: 978-3-540-72383-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics