A local linear embedding algorithm based on the harmonic-mean geodesic kernel
From MaRDI portal
Recommendations
Cited in
(6)- A comment on ``Using locally estimated geodesic distance to optimize neighborhood graph for isometric data embedding
- Using locally estimated geodesic distance to optimize neighborhood graph for isometric data embedding
- Local kernels and the geometric structure of data
- A locally linear embedding based on an improved distance
- Geodesic distance-based generalized Gaussian Laplacian eigenmap
- A small world neighborhood optimized local linear embedding algorithm
This page was built for publication: A local linear embedding algorithm based on the harmonic-mean geodesic kernel
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3017231)