Skip to main content

A Feature Space Alignment Learning Algorithm

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 7458))

Abstract

Manifold learning algorithms have been proved to be effective in pattern recognition, image analysis and data mining etc. The local tangent space alignment (LTSA) algorithm is a representative manifold learning method for dimension reduction. However, datasets cannot preserve their original features very well after dimension reduction by LTSA, due to the deficiency of local subspace construction in LTSA, especially when data dimensionality is large. To solve this problem, a novel subspace manifold learning algorithm called feature space alignment learning (FSAL in short) is proposed in this paper. In this algorithm, we employ candid covariance-free independent principal component analysis (CCIPCA) as a preprocessing step. Experiments over artificial and real datasets validate the effectiveness of the proposed method.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Turk, M., Pentland, A.P.: Face recognition using eigenfaces. In: IEEE Conf. on Computer Vision and Pattern Recognition (1991)

    Google Scholar 

  2. 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 

  3. Roweis, S.T., Saul, L.K.: Nonlinear dimensionality reduction by locally linear embedding. Science 290, 2323–2326 (2000)

    Article  Google Scholar 

  4. Belkin, M., Niyogi, P.: Laplacian eigenmaps for dimensionality reduction and data representation. Neural Computation 15(6), 1373–1396 (2003)

    Article  MATH  Google Scholar 

  5. Zhang, Z.Y., Zha, H.Y.: Principal manifolds and nonlinear dimensionality reduction via tangent space alignment. SIAM Journal of Scientific Computing 26, 313–338 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  6. Weng, J.Y., Zhang, Y.L., Hwang, W.S.: Candid Covariance-free Incremental Principal Component Analysis. IEEE Trans. on Pattern Analysis and Machine Intelligence 25 (2003)

    Google Scholar 

  7. Min, W.L., Lu, L., He, X.F.: Locality pursuit embedding. Pattern Recognition 37(4), 781–788 (2004)

    Article  MATH  Google Scholar 

  8. Oja, E.: Subspace Methods of Pattern Recognition. Research Studies Press, Letchworth (1983)

    Google Scholar 

  9. Oja, E., Karhunen, J.: On stochastic approximation of the eigenvectors and eigenvalues of the expectation of a random matrix. Journal of Mathematical Analysis and Application 106, 69–84 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  10. Kreyszig, E.: Advanced engineering mathematics. Wiley, New York (1988)

    Google Scholar 

  11. http://www.cs.toronto.edu/~roweis/data.html

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tan, C., Guan, J. (2012). A Feature Space Alignment Learning Algorithm. In: Anthony, P., Ishizuka, M., Lukose, D. (eds) PRICAI 2012: Trends in Artificial Intelligence. PRICAI 2012. Lecture Notes in Computer Science(), vol 7458. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32695-0_75

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32695-0_75

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32694-3

  • Online ISBN: 978-3-642-32695-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics