Abstract
The kcenter problem for a point set P asks for a collection of k congruent balls (that is, balls of equal radius) that together cover all the points in P and whose radius is minimized. The kcenter problem with outliers is defined similarly, except that z of the points in P do need not to be covered, for a given parameter z. We study the kcenter problem with outliers in data streams in the slidingwindow model. In this model we are given a possibly infinite stream P = ⟨ p₁,p₂,p₃,…⟩ of points and a time window of length W, and we want to maintain a small sketch of the set P(t) of points currently in the window such that using the sketch we can approximately solve the problem on P(t).
We present the first algorithm for the kcenter problem with outliers in the slidingwindow model. The algorithm works for the case where the points come from a space of bounded doubling dimension and it maintains a set S(t) such that an optimal solution on S(t) gives a (1+ε)approximate solution on P(t). The algorithm uses O((kz/ε^d)log σ) storage, where d is the doubling dimension of the underlying space and σ is the spread of the points in the stream. Algorithms providing a (1+ε)approximation were not even known in the setting without outliers or in the insertiononly setting with outliers. We also present a lower bound showing that any algorithm that provides a (1+ε)approximation must use Ω((kz/ε)log σ) storage.
BibTeX  Entry
@InProceedings{deberg_et_al:LIPIcs.ESA.2021.13,
author = {de Berg, Mark and Monemizadeh, Morteza and Zhong, Yu},
title = {{kCenter Clustering with Outliers in the SlidingWindow Model}},
booktitle = {29th Annual European Symposium on Algorithms (ESA 2021)},
pages = {13:113:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {9783959772044},
ISSN = {18688969},
year = {2021},
volume = {204},
editor = {Mutzel, Petra and Pagh, Rasmus and Herman, Grzegorz},
publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2021/14594},
URN = {urn:nbn:de:0030drops145945},
doi = {10.4230/LIPIcs.ESA.2021.13},
annote = {Keywords: Streaming algorithms, kcenter problem, sliding window, bounded doubling dimension}
}
Keywords: 

Streaming algorithms, kcenter problem, sliding window, bounded doubling dimension 
Collection: 

29th Annual European Symposium on Algorithms (ESA 2021) 
Issue Date: 

2021 
Date of publication: 

31.08.2021 