epsilon-Samples of Kernels
@article{Phillips2011epsilonSamplesOK, title={epsilon-Samples of Kernels}, author={J. M. Phillips}, journal={arXiv: Computational Geometry}, year={2011} }
We study the worst case error of kernel density estimates via subset approximation. A kernel density estimate of a distribution is the convolution of that distribution with a fixed kernel (e.g. Gaussian kernel). Given a subset (i.e. a point set) of the input distribution, we can compare the kernel density estimates of the input distribution with that of the subset and bound the worst case error. If the maximum error is eps, then this subset can be thought of as an eps-sample (aka an eps… CONTINUE READING
References
SHOWING 1-10 OF 22 REFERENCES
A divide-and-conquer algorithm for min-cost perfect matching in the plane
- Mathematics, Computer Science
- Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)
- 1998
- 65
- Highly Influential
- PDF
Worst-case bounds for subadditive geometric graphs
- Mathematics, Computer Science
- SCG '93
- 1993
- 22
- Highly Influential
- PDF
Constructive Discrepancy Minimization by Walking on the Edges
- Mathematics, Computer Science
- 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
- 2012
- 69
- PDF
Comparing distributions and shapes using the kernel distance
- Mathematics, Computer Science
- SoCG '11
- 2011
- 58
- PDF
Structure-Aware Sampling: Flexible and Accurate Summarization
- Computer Science
- Proc. VLDB Endow.
- 2011
- 16
- PDF
The VC-Dimension of SQL Queries and Selectivity Estimation through Sampling
- Computer Science
- ECML/PKDD
- 2011
- 26
- PDF
A note about weak epsilon-nets for axis-parallel boxes in d-space
- Mathematics, Computer Science
- Inf. Process. Lett.
- 2010
- 13
Constructive Algorithms for Discrepancy Minimization
- Mathematics, Computer Science
- 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
- 2010
- 135
- PDF