Geometric Inference on Kernel Density Estimates
Not on the map. Why?
Abstract (arXiv)
We show that geometric inference of a point cloud can be calculated by examining its kernel density estimate with a Gaussian kernel. This allows one to consider kernel density estimates, which are robust to spatial noise, subsampling, and approximate computation in comparison to raw point sets. This is achieved by examining the sublevel sets of the kernel distance, which isomorphically map to superlevel sets of the kernel density estimate. We prove new properties about the kernel distance, demonstrating stability results and allowing it to inherit reconstruction results from recent advances in distance-based topological reconstruction. Moreover, we provide an algorithm to estimate its topology using weighted Vietoris-Rips complexes.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). First posted on arXiv 29 Jul 2013.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 1; 2024: 1.
2 papers.
- 2024No Dimensional Sampling Coresets for Classificationcited by 4
- 2023Dimensionality Reduction for General KDE Mode Findingcited by 2
- 2024No Dimensional Sampling Coresets for Classification7 Feb 2024
- 2023Dimensionality Reduction for General KDE Mode Finding30 May 2023