Sign in

Provable Imbalanced Point Clustering

By David Denisov and others
We suggest efficient and provable methods to compute an approximation for imbalanced point clustering, that is, fitting k-centers to a set of points in \mathbb{R}^d, for any d,k\geq 1. To this end, we utilize \emph{coresets}, which, in the context of the paper, are essentially weighted sets of points in \mathbb{R}^d... Show more
August 26, 2024
=
0
Loading PDF…
Loading full text...
Similar articles
Loading recommendations...
=
0
x1
Provable Imbalanced Point Clustering
Click on play to start listening