Name
Abstract | ||
|---|---|---|
The Vapnik-Chervonenkis dimension provides a notion of complexity for systems of sets. If the VC dimension is small, then knowing this can drastically simplify fundamental computational tasks such as classification, range counting, and density estimation through the use of sampling bounds. We analyze set systems where the ground set $X$ is a set of polygonal curves in $mathbb{R}^d$ and the sets $mathcal{R}$ are metric balls defined by curve similarity metrics, such as the Fru0027echet distance and the Hausdorff distance, as well as their discrete counterparts. We derive upper and lower bounds on the VC dimension that imply useful sampling bounds in the setting that the number of curves is large, but the complexity of the individual curves is small. Our upper bounds are either near-quadratic or near-linear in the complexity of the curves that define the ranges and they are logarithmic in the complexity of the curves that define the ground set. |
Year | Venue | DocType |
|---|---|---|
2019 | symposium on computational geometry | Journal |
Volume | Citations | PageRank |
abs/1903.03211 | 0 | 0.34 |
References | Authors | |
11 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Anne Driemel | 1 | 157 | 11.41 |
| Jeff M. Phillips | 2 | 536 | 49.83 |
| Ioannis Psarros | 3 | 10 | 4.33 |