Improved local search algorithms for Bregman \(k\)-means and its variants

DOI10.1007/s10878-021-00771-9zbMath1504.90137OpenAlexW3173586217MaRDI QIDQ2084627

Longkun Guo, Xiaoyun Tian, Dan Wu, Da-Chuan Xu

Publication date: 18 October 2022

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-021-00771-9

zbMATH Keywords

local search\(k\)-meansseeding algorithm\( \mu \)-similar Bregman divergences

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An iterative row-action method for interval convex programming
• Clustering for metric and nonmetric distance measures
• Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering
• On the Optimality of Conditional Expectation as a Bregman Predictor
• Bregman Clustering for Separable Instances
• A local search approximation algorithm for k-means clustering
• Least squares quantization in PCM
• Noisy, Greedy and Not so Greedy k-Means++

This page was built for publication: Improved local search algorithms for Bregman \(k\)-means and its variants