ISOLLE: LLE with geodesic distance
暂无分享，去创建一个
We propose an extension of the algorithm for nonlinear dimensional reduction locally linear embedding (LLE) based on the usage of the geodesic distance (ISOLLE). In LLE, each data point is reconstructed from a linear combination of its n nearest neighbors, which are typically found using the Euclidean distance. We show that the search for the neighbors performed with respect to the geodesic distance can lead to a more accurate preservation of the data structure. This is confirmed by experiments on both real-world and synthetic data.
[1] Pietro Perona,et al. Grouping and dimensionality reduction by locally linear embedding , 2001, NIPS.
[2] Amaury Lendasse,et al. A robust nonlinear projection method , 2000 .
[3] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[4] S T Roweis,et al. Nonlinear dimensionality reduction by locally linear embedding. , 2000, Science.
[5] Michel Verleysen,et al. A robust non-linear projection method , 2000, ESANN.