Point Localization and Density Estimation from Ordinal kNN graphs using Synchronization

no code implementations • 3 Apr 2015 • Mihai Cucuringu, Joseph Woodworth

We demonstrate the scalability of our approach on large graphs, and show how it compares to the Local Ordinal Embedding (LOE) algorithm, which was recently proposed for recovering the configuration of a cloud of points from pairwise ordinal comparisons between a sparse set of distances.

Density Estimation