Advertisement
Published in:
2015 | OriginalPaper | Chapter
A Fast Isomap Algorithm Based on Fibonacci Heap
Authors : Taiguo Qu, Zixing Cai
Published in: Advances in Swarm and Computational Intelligence
Publisher: Springer International Publishing
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.