Coresets and approximate clustering for Bregman divergences.
Marcel R. AckermannJohannes BlömerPublished in: SODA (2009)
Keyphrases
- bregman divergences
- information theoretic
- clustering algorithm
- cost sensitive
- clustering method
- k means
- maximum entropy
- data clustering
- loss function
- theoretical guarantees
- mahalanobis distance
- squared euclidean distance
- nonnegative matrix factorization
- spectral clustering
- kl divergence
- data points
- data dependent
- document clustering
- nearest neighbor