Coresets for Gaussian Mixture Models of Any Shape

no code implementations • 12 Jun 2019 • Dan Feldman, Zahi Kfir, Xuan Wu

For example, for any input set $D$ whose coordinates are integers in $[-n^{100}, n^{100}]$ and any fixed $k, d\geq 1$, the coreset size is $(\log n)^{O(1)}/\varepsilon^2$, and can be computed in time near-linear in $n$, with high probability.

Clustering