An improved Bregman k-means++ algorithm via local search

DOI10.1007/978-3-030-58150-3_43MaRDI QIDQ2019501zbMATH OpenOpenAlexFDO

Authors Xiaoyun Tian, Longkun Guo, Dan Wu, Dachuan Xu

Publication date 21 April 2021

Full work available at URL https://doi.org/10.1007/978-3-030-58150-3_43

zbMATH Keywords

\(k\)-meanslocal searchseeding algorithm\(\mu\)-similar Bregman divergences

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Computational aspects of data analysis and big data (68T09) Measures of information, entropy (94A17) Approximation algorithms (68W25)

Recommendations

• Improved local search algorithms for Bregman k-means and its variants
• The spherical k-means++ algorithm via local search scheme
• The spherical \(k\)-means++ algorithm via local search
• A local search approximation algorithm for the \(k\)-means problem with penalties
• Local search approximation algorithms for the k-means problem with penalties
• A local search approximation algorithm for \(k\)-means clustering
• A local search approximation algorithm for \(k\)-means clustering
• An improved approximation algorithm for the \(k\)-means problem with penalties
• Approximation algorithms for spherical \(k\)-means problem using local search scheme

Cites work

• scientific article; zbMATH DE number 6381735 (Why is no real title available?)
• scientific article; zbMATH DE number 41467 (Why is no real title available?)
• scientific article; zbMATH DE number 3296905 (Why is no real title available?)
• A local search approximation algorithm for \(k\)-means clustering
• An iterative row-action method for interval convex programming
• Clustering for metric and nonmetric distance measures
• Clustering with Bregman divergences.
• Coresets and approximate clustering for Bregman divergences
• Least squares quantization in PCM
• On the Optimality of Conditional Expectation as a Bregman Predictor
• Turning big data into tiny data: constant-size coresets for k-means, PCA and projective clustering

Cited in

(3)

• Improved local search algorithms for Bregman k-means and its variants
• Bregman clustering for separable instances
• Improving K-means method via shrinkage estimation and LVQ algorithm

This page was built for publication: An improved Bregman \(k\)-means++ algorithm via local search

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