Skip to main content

About Eigenvalues from Embedding Data Complex in Low Dimension

  • Conference paper
Advances in Swarm Intelligence (ICSI 2012)

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

Included in the following conference series:

  • 2116 Accesses

Abstract

LLE(Local linear embedding) and Isomap are widely used approaches for dimension reduction on data complex. The embedding results from the two methods are eigenvectors from solving specific matrices. The corresponding eigenvalues for the selected eigenvectors have important meaning for the embedding results. In this paper, the k-nn method and ε-distance approach are used for neighborhood function with parameters. Then, different datasets and parameters will be applied to obtain the embedding results and eigenvalues. The main change of eigenvalues and the corresponding embedding results will be shown in this paper.

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Sam, R., Lawrence, S.: Nonlinear Dimensionality Reduction by Locally Linear Embedding. Science 290(5500), 2323–2326 (2000)

    Article  Google Scholar 

  2. Yeh, T.T., Chen, T.-Y., Chen, Y.-C., Shih, W.-K.: Efficient Parallel Algorithm for Nonlinear Dimensionality Reduction on GPU. In: 2010 IEEE International Conference on Granular Computing, pp. 592–597. IEEE Computer Society (2010)

    Google Scholar 

  3. Chang, H., Yeung, D.-Y.: Robust Locally Linear Embedding. Pattern Recognition 39, 1053–1065 (2006)

    Article  MATH  Google Scholar 

  4. Zuo, W., Zhang, D., Wang, K.: On Kernel Difference-weighted K-nearest Neighbor Classification. Pattern Analysis and Applications 11, 247–257 (2008)

    Article  MathSciNet  Google Scholar 

  5. Wen, G., Jiang, L., Wen, J., Shadbolt, N.R.: Clustering-Based Nonlinear Dimensionality Reduction on Manifold. In: Yang, Q., Webb, G. (eds.) PRICAI 2006. LNCS (LNAI), vol. 4099, pp. 444–453. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  6. Wei, L., Zeng, W., Wang, H.: K-means Clustering with Manifold. In: 2010 Seventh International Conference on Fuzzy Systems and Knowledge Discovery, pp. 2095–2099. IEEE Xplore Digital Library and EI Compendex (2010)

    Google Scholar 

  7. Joshua, T., de Vin, S., John, C.L.: A Global Geometric Framework for Nonlinear Dimensionality Reduction. Science 290(5500), 2319–2323 (2000)

    Article  Google Scholar 

  8. Lawrence, S., Sam, R.: Think Globally, Fit Locally: Unsupervised Learning of Low Dimensional Manifolds. Journal of Machine Learning Research 4, 119–155 (2003)

    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

Liou, JW., Liou, CY. (2012). About Eigenvalues from Embedding Data Complex in Low Dimension. In: Tan, Y., Shi, Y., Ji, Z. (eds) Advances in Swarm Intelligence. ICSI 2012. Lecture Notes in Computer Science, vol 7332. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31020-1_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31020-1_33

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31019-5

  • Online ISBN: 978-3-642-31020-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics