Abstract
For the slow operational speed problem of Isomap algorithm in which the Floyd-Warshall algorithm is applied to finding shortest paths, an improved Isomap algorithm is proposed based on the sparseness of the adjacency graph. In the improved algorithm, the runtime for shortest paths is reduced by using Dijkstra’s algorithm based on Fibonacci heap, and thus the Isomap operation is speeded up. The experimental results on several data sets show that the improved version of Isomap is faster than the original one.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Tenenbaum, J.B., de Silva, V., Langford, J.: A global geometric framework for nonlinear dimensionality reduction. J. Science 290, 2319–2323 (2000)
Jolliffe, I.T.: Principal component analysis, 2nd edn. Springer, New York (2002)
Cox, T., Cox, M.: Multidimensional scaling, 2nd edn. Chapman & Hall/CRC, London (2001)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., et al.: Introduction to algorithms, 3rd edn. MIT Press, Cambridge (2009)
Tenenbaum, J.: Mapping a manifold of perceptual observations. In: Advances in Neural Information Processing Systems, pp. 682–688. MIT Press, Cambridge (1998)
The MNIST database of handwritten digits. http://yann.lecun.com/exdb/mnist
Data for MATLAB hackers. http://www.cs.toronto.edu/~roweis/data.html
Data sets for nonlinear dimensionality reduction. http://isomap.stanford.edu/datasets.html.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Qu, T., Cai, Z. (2015). A Fast Isomap Algorithm Based on Fibonacci Heap. In: Tan, Y., Shi, Y., Buarque, F., Gelbukh, A., Das, S., Engelbrecht, A. (eds) Advances in Swarm and Computational Intelligence. ICSI 2015. Lecture Notes in Computer Science(), vol 9142. Springer, Cham. https://doi.org/10.1007/978-3-319-20469-7_25
Download citation
DOI: https://doi.org/10.1007/978-3-319-20469-7_25
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-20468-0
Online ISBN: 978-3-319-20469-7
eBook Packages: Computer ScienceComputer Science (R0)