ε-Kernel Coresets for Stochastic Points

Authors

Haitao Wang, Utah State UniversityFollow
Lingxiao Huang, Tsinghua University
Jian Li, Tsinghua University
Jeff Mark Phillips, University of Utah

Document Type

Conference Paper

Journal/Book Title/Conference

24th Annual European Symposium on Algorithms (ESA 2016)

Volume

57

Publisher

Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing

Publication Date

8-1-2016

First Page

50:1

Last Page

50:18

Abstract

With the dramatic growth in the number of application domains that generate probabilistic, noisy and uncertain data, there has been an increasing interest in designing algorithms for geometric or combinatorial optimization problems over such data. In this paper, we initiate the study of constructing epsilon-kernel coresets for uncertain points. We consider uncertainty in the existential model where each point's location is fixed but only occurs with a certain probability, and the locational model where each point has a probability distribution describing its location. An epsilon-kernel coreset approximates the width of a point set in any direction. We consider approximating the expected width (an ε-EXP-KERNEL), as well as the probability distribution on the width (an (ε, tau)-QUANT-KERNEL) for any direction. We show that there exists a set of O(ε^{-(d-1)/2}) deterministic points which approximate the expected width under the existential and locational models, and we provide efficient algorithms for constructing such coresets. We show, however, it is not always possible to find a subset of the original uncertain points which provides such an approximation. However, if the existential probability of each point is lower bounded by a constant, an ε-EXP-KERNEL is still possible. We also provide efficient algorithms for construct an (ε, τ)-QUANT-KERNEL coreset in nearly linear time. Our techniques utilize or connect to several important notions in probability and geometry, such as Kolmogorov distances, VC uniform convergence and Tukey depth, and may be useful in other geometric optimization problem in stochastic settings. Finally, combining with known techniques, we show a few applications to approximating the extent of uncertain functions, maintaining extent measures for stochastic moving points and some shape fitting problems under uncertainty.

Comments

http://drops.dagstuhl.de/opus/volltexte/2016/6392/

Recommended Citation

Huang, L., Li, J., Phillips, J.M., Wang, H. ϵ-Kernel coresets for stochastic points (2016) Leibniz International Proceedings in Informatics, LIPIcs, 57, art. no. 50, .