Skip to main content

Discriminant Graph Based Linear Embedding

  • Conference paper
Intelligent Computing Technology (ICIC 2012)

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

Included in the following conference series:

  • 2650 Accesses

Abstract

LLE is a nonlinear dimensionality reduction method, which has been successfully applied to data visualization. Based on the assumption of local linearity, LLE can compute the weights between the KNN nodes using the local least reconstruction errors, which increase the computational cost. In this paper, a method titled Discriminant Graph Based Linear Embedding (DGBLE) is proposed to set the weights between the nodes in the KNN graph directly to reduce the computational expense. Moreover, label information can also be taken into account to improve the discriminant power of the original LLE. Experiments on some benchmark data show that the proposed method is feasible and effective.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. Jain, A.K., Duin, R.P.W., Mao, J.C.: Statistical Pattern Recognition: A review. IEEE Transactions on Pattern Analysis and Machine Intelligence 22, 4–37 (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 Eigenmaps and Spectral Techniques for Embedding and Clustering. In: Dietterich, T.G., Becker, S., Ghahramani, Z. (eds.) Advances in Neural Information Processing Systems, vol. 14, pp. 585–591. MIT Press, Cambridge (2002)

    Google Scholar 

  4. Biometrics Research Centre, http://www4.comp.polyu.edu.hk/~biometrics

  5. Martinez, A.M., Kak, A.C.: PCA versus LDA. IEEE Trans. Pattern Analysis and Machine Intelligence 23(2), 228–233 (2001)

    Article  Google Scholar 

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

    Article  Google Scholar 

  7. Kokiopoulou, E., Saad, Y.: Orthogonal Neighborhood Preserving Projections. In: The Fifth IEEE International Conference on Data Mining, pp. 1–7. IEEE Press, New York (2005)

    Google Scholar 

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

Li, B., Liu, J., Dong, WY., Zhang, WS. (2012). Discriminant Graph Based Linear Embedding. In: Huang, DS., Jiang, C., Bevilacqua, V., Figueroa, J.C. (eds) Intelligent Computing Technology. ICIC 2012. Lecture Notes in Computer Science, vol 7389. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31588-6_52

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31588-6_52

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31587-9

  • Online ISBN: 978-3-642-31588-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics