Coresets and approximate clustering for Bregman divergences
From MaRDI portal
(Redirected from Publication:4633923)
Statistical aspects of information-theoretic topics (62B10) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Approximation algorithms (68W25) Analysis of algorithms (68W40)
Recommendations
- Bregman clustering for separable instances
- Clustering for metric and nonmetric distance measures
- On coresets for k-means and k-median clustering
- On Coresets for k-Median and k-Means Clustering in Metric and Euclidean Spaces and Their Applications
- Smaller coresets for \(k\)-median and \(k\)-means clustering
Cited in
(11)- An improved Bregman k-means++ algorithm via local search
- Improved local search algorithms for Bregman k-means and its variants
- Clustering for metric and nonmetric distance measures
- Bregman clustering for separable instances
- Improved analysis of D^2-sampling based PTAS for k-means and other clustering problems
- A simple \(D^2\)-sampling based PTAS for \(k\)-means and other clustering problems
- Right Rényi mean and tensor product
- Coresets for Discrete Integration and Clustering
- Right mean for the \(\alpha - z\) Bures-Wasserstein quantum divergence
- Quantum divergence and barycenter associated with the spectral geometric mean
- Fast Kd-trees for the Kullback-Leibler divergence and other decomposable Bregman divergences
This page was built for publication: Coresets and approximate clustering for Bregman divergences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4633923)
