Name
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. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1109/ICMLA.2019.00253 | arXiv: Algebraic Topology |
Field | DocType | Citations |
Topological data analysis,Pattern recognition,Polynomial,Computer science,Algorithm,Heuristics,Minification,Software,Algebraic variety,Artificial intelligence,Sampling (statistics),Adaptive algorithm | Conference | 3 |
PageRank | References | Authors |
0.47 | 8 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Emilie Dufresne | 1 | 3 | 0.81 |
| Parker B. Edwards | 2 | 3 | 0.47 |
| Heather A. Harrington | 3 | 3 | 1.83 |
| Jonathan D. Hauenstein | 4 | 269 | 37.65 |