Nearly Optimal Dynamic $k$-Means Clustering for High-Dimensional Data

arXiv: Data Structures and Algorithms, 2018.

Cited by: 1|Views36

Abstract:

We consider the $k$-means clustering problem in the dynamic streaming setting, where points from a discrete Euclidean space ${1, 2, ldots, Delta}^d$ can be dynamically inserted to or deleted from the dataset. For this problem, we provide a one-pass coreset construction algorithm using space $tilde{O}(kcdot mathrm{poly}(d, logDelta))$, whe...More

Code:

Data:

Your rating :
0

 

Tags
Comments