Isomap - Algorithm
•Determine the
neighbors.
–All points in a fixed
radius.
–K nearest
neighbors
• Construct a neighborhood graph.
–Each point is
connected to the other if it is a K nearest neighbor.
–Edge Length equals the
Euclidean distance
•Compute the shortest
paths between two nodes
–Floyd’s Algorithm
–Djkastra’s
ALgorithm
•Construct a lower
dimensional embedding.
–Classical MDS