Create and explore imaginative 3D worlds with our new product Dreamfield (opens in a new tab)
Papers
Topics
Authors
Recent
Search
2000 character limit reached

Streaming Euclidean kk-median and kk-means with o(log⁡n)o(\log n) Space

Published 4 Oct 2023 in cs.DS | (2310.02882v1)

Abstract: We consider the classic Euclidean kk-median and kk-means objective on data streams, where the goal is to provide a (1+ε)(1+\varepsilon)-approximation to the optimal kk-median or kk-means solution, while using as little memory as possible. Over the last 20 years, clustering in data streams has received a tremendous amount of attention and has been the test-bed for a large variety of new techniques, including coresets, the merge-and-reduce framework, bicriteria approximation, sensitivity sampling, and so on. Despite this intense effort to obtain smaller sketches for these problems, all known techniques require storing at least Ω(log⁡(nΔ))\Omega(\log(n\Delta)) words of memory, where nn is the size of the input and Δ\Delta is the aspect ratio. A natural question is if one can beat this logarithmic dependence on nn and Δ\Delta. In this paper, we break this barrier by first giving an insertion-only streaming algorithm that achieves a (1+ε)(1+\varepsilon)-approximation to the more general (k,z)(k,z)-clustering problem, using O~(dkε2)⋅(2zlog⁡z)⋅min⁡(1εz,k)⋅poly(log⁡log⁡(nΔ))\tilde{\mathcal{O}}\left(\frac{dk}{\varepsilon^2}\right)\cdot(2^{z\log z})\cdot\min\left(\frac{1}{\varepsilon^z},k\right)\cdot\text{poly}(\log\log(n\Delta)) words of memory. Our techniques can also be used to achieve two-pass algorithms for kk-median and kk-means clustering on dynamic streams using O~(1ε2)⋅poly(d,k,log⁡log⁡(nΔ))\tilde{\mathcal{O}}\left(\frac{1}{\varepsilon^2}\right)\cdot\text{poly}(d,k,\log\log(n\Delta)) words of memory.

Citations (8)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.