Abstract
When a data set resides on a d-dimensional manifold that is not a subspace, linear methods cannot effectively reduce the data dimension. Nonlinear methods need to be applied in this case. In this chapter, we introduce Isomap method, which unfolds a manifold by keeping the geodesic metric on the original data set. The description of the method is given in Section 8.1, and the Isomap algorithm is presented in Section 8.2. In Section 8.3, we introduce Dijkstra’s algorithm that effectively computes graph distances. The experiments and applications of Isomaps are included in Section 8.4. We present the justification of Isomaps in Section 8.5.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
de Silva, V., Tenenbaum, J.B.: Global versus local methods in nonlinear dimensionality reduction. In: S. Becker, S. Thrun, K. Obermayer (eds.) Neural Information Processing Systems (NIPS 2002), pp. 705–712. MIT Press (2002).
Tenenbaum, J.B., de Silva, V., Langford, J.C.: A global geometric framework for nonlinear dimensionality reduction. Science 290(5500), 2319–2323 (2000).
Bachmann, C.M., Ainsworth, T.L., Fusina, R.A.: Exploiting manifold geometry in hyperspectral imagery. IEEE Trans. Geo. Remote Sensing 43(3), 441–454 (2005).
Bachmann, C.M., Ainsworth, T.L., Fusina, R.A.: Improved manifold coordinate representations of large-scale hyperspectral scenes. IEEE Trans. Geo. Remote Sensing 44, 2786–2803 (2006).
Bachmann, C.M., Ainsworth, T.L., Fusina, R.A., Montes, M.J., Bowles, J.H., Korwan, D.R., Gillis, L.: Bathymetric retrieval from hyperspectral imagery using manifold coordinate representations. IEEE Trans. Geo. Remote Sensing 47, 884–897 (2009).
Balasubramanian, M., Schwartz, E.,: The isomap algorithm and topological stability. Science 295, 9 (2002).
Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1, 269–271 (1959).
Cailliez, F.: The analytical solution of the additive constant problem. Psychometrika 48(2), 305–308 (1983).
Kumar, V., Grama, A., Gupta, A., Karypis, G.: Introduction to Parallel Computing, Design and Analysis of Algorithms. The Benjamin/Cummings Publishing Company, Inc., California (1994).
Choi, H., Choi, S.: Robust kernel isomap. Pattern Recogn. 40.
Bernstein, M., de Silva, V., Langford, J., Tenenbaum, J.: Graph approximations to geodesics on embedded manifolds (2000).
Tenenbaum, J.B., de Silva, V., Langford, J.C.: Graph approximation to geodesics on embedded manifold (2000), Preprint.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2012 Higher Education Press, Beijing and Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Wang, J. (2012). Isomaps. In: Geometric Structure of High-Dimensional Data and Dimensionality Reduction. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27497-8_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-27497-8_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27496-1
Online ISBN: 978-3-642-27497-8
eBook Packages: Computer ScienceComputer Science (R0)