The ISOLLE algorithm diers from LLE only in the rst step, i.e. the neighbors
search. More specically, ISOLLE computes the n nearest neighbors of each data
point according to the geodesic distance. For this purpose we employ a small
variation of Dijkstra's algorithm [12]. Given a graph, this algorithm computes
the shortest paths from a particular node to all remaining nodes. In our case we
restrict the computation to the n shortest paths.