Bregman clustering for separable instances

DOI10.1007/978-3-642-13731-0_21zbMATH Open1285.68212OpenAlexW1561129100MaRDI QIDQ3569892FDOQ3569892

Johannes Blömer, Marcel R. Ackermann

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

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

Mathematics Subject Classification ID

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

Cited In (4)

• Tight lower bound instances for \(k\)-means++ in two dimensions
• Improved local search algorithms for Bregman \(k\)-means and its variants
• A simple \(D^2\)-sampling based PTAS for \(k\)-means and other clustering problems
• Clustering in Hilbert’s Projective Geometry: The Case Studies of the Probability Simplex and the Elliptope of Correlation Matrices

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)