Isomap [1]} [2]}[3]} maps data points in high-dimensional nonlinear manifold to a lower dimensional set of coordinates. It successfully addresses important limitations in MDS[4]} by using geodesic distance - distance along the curve- between two given points - instead of Euclidean distance - which is the straight-line distance between corresponding nodes. The algorithm works by creating a neighborhood and neighbors are converted into a graph structure. In particular, the steps of the algorithm are as follows.
