Name
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. |
Year | Venue | Field |
|---|---|---|
2015 | ICSI | Fibonacci heap,Shortest path problem,Computer science,Algorithm,Yen's algorithm,Floyd–Warshall algorithm,Suurballe's algorithm,Artificial intelligence,Shortest Path Faster Algorithm,Machine learning,Dijkstra's algorithm,Isomap |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
1 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Taiguo Qu | 1 | 1 | 1.37 |
| Zixing Cai | 2 | 1525 | 66.96 |