Bregman clustering for separable instances

DOI10.1007/978-3-642-13731-0_21MaRDI QIDQ3569892zbMATHOpenAlexFDO

Authors Marcel R. Ackermann, Johannes Blömer

Publication date 22 June 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13731-0_21

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Approximation algorithms (68W25)

Recommendations

• Coresets and approximate clustering for Bregman divergences
• 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
• Analysis of \(k\)-means++ for separable data

Cited in

(5)

• Tight lower bound instances for \(k\)-means++ in two dimensions
• Improved local search algorithms for Bregman \(k\)-means and its variants
• Coresets and approximate clustering for Bregman divergences
• Clustering in Hilbert's projective geometry: the case studies of the probability simplex and the elliptope of correlation matrices
• A simple \(D^2\)-sampling based PTAS for \(k\)-means and other clustering problems

This page was built for publication: Bregman clustering for separable instances

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569892)