no code implementations • 30 May 2019 • Daniel Mckenzie, Steven Damelin
We study the use of power weighted shortest path distance functions for clustering high dimensional Euclidean data, under the assumption that the data is drawn from a collection of disjoint low dimensional manifolds.