Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Sampling real algebraic varieties for topological data analysis. / Dufresne, Emilie Sonia; Edwards, Parker B.; Harrington, Heather A; Hauenstein, Jonathan D.
18th IEEE International Conference on Machine Learning and Applications : ICMLA 2019. IEEE, 2020.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Sampling real algebraic varieties for topological data analysis
AU - Dufresne, Emilie Sonia
AU - Edwards, Parker B.
AU - Harrington, Heather A
AU - Hauenstein, Jonathan D.
N1 - Conference code: 18th
PY - 2020/2/17
Y1 - 2020/2/17
N2 - 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.
AB - 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.
U2 - 10.1109/ICMLA.2019.00253
DO - 10.1109/ICMLA.2019.00253
M3 - Conference contribution
SN - 978-1-7281-4549-5
BT - 18th IEEE International Conference on Machine Learning and Applications
PB - IEEE
T2 - IEEE International Conference On Machine Learning And Applications
Y2 - 16 December 2019 through 19 December 2019
ER -