Abstract
Topological data analysis (TDA) provides tools for computing geometric and topological information about spaces from a finite sample of points. We present an adaptive algorithm for finding provably dense samples of points on real algebraic varieties given a set of defining polynomials for use as input to TDA. The algorithm utilizes methods from numerical algebraic geometry to give formal guarantees about the density of the sampling, and also employs geometric heuristics to reduce the size of the sample. As TDA methods consume significant computational resources that scale poorly in the number of sample points, our sampling minimization makes applying TDA methods more feasible. We provide a software package that implements the algorithm, and showcase it through several examples.
Original language | English |
---|---|
Title of host publication | 18th IEEE International Conference on Machine Learning and Applications |
Subtitle of host publication | ICMLA 2019 |
Publisher | IEEE |
Number of pages | 6 |
ISBN (Print) | 978-1-7281-4549-5 |
DOIs | |
Publication status | Published - 17 Feb 2020 |
Event | IEEE International Conference On Machine Learning And Applications - Boca Raton, United States Duration: 16 Dec 2019 → 19 Dec 2019 Conference number: 18th |
Conference
Conference | IEEE International Conference On Machine Learning And Applications |
---|---|
Abbreviated title | ICMLA |
Country/Territory | United States |
City | Boca Raton |
Period | 16/12/19 → 19/12/19 |