no code implementations • 14 Jul 2023 • Alessandro Epasto, Tamalika Mukherjee, Peilin Zhong
In this work, we provide the first differentially private streaming algorithms for $k$-means and $k$-median clustering of $d$-dimensional Euclidean data points over a stream with length at most $T$ using $poly(k, d,\log(T))$ space to achieve a constant multiplicative error and a $poly(k, d,\log(T))$ additive error.
no code implementations • 27 Dec 2021 • Jeremiah Blocki, Elena Grigorescu, Tamalika Mukherjee
Clustering is an essential primitive in unsupervised machine learning.