Bregman Clustering for Separable Instances

DOI10.1007/978-3-642-13731-0_21zbMath1285.68212OpenAlexW1561129100MaRDI QIDQ3569892

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

Mathematics Subject Classification ID

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

Related Items (4)

Tight lower bound instances for \(k\)-means++ in two dimensions ⋮ 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 ⋮ Improved local search algorithms for Bregman \(k\)-means and its variants

This page was built for publication: Bregman Clustering for Separable Instances