Efficient and Robust Persistent Homology for Measures
read the original abstract
We extend the notion of the distance to a measure from Euclidean space to probability measures on general metric spaces as a way to do topological data analysis in a way that is robust to noise and outliers. We then give an efficient way to approximate the sub-level sets of this function by a union of metric balls and extend previous results on sparse Rips filtrations to this setting. This robust and efficient approach to topological data analysis is illustrated with several examples from an implementation.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
The Poincar\'e-Boltzmann Machine: from Statistical Physics to Machine Learning and back
Information cohomology is computed in low degrees to establish multivariate mutual informations as k-coboundaries, with simplicial structures yielding free-energy interpretations and a topological minimum free energy complex.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.