An improved Bregman k-means++ algorithm via local search
From MaRDI portal
Publication:2019501
DOI10.1007/978-3-030-58150-3_43zbMATH Open1482.68221OpenAlexW3081520733MaRDI QIDQ2019501FDOQ2019501
Longkun Guo, Dachuan Xu, Dan Wu, Xiaoyun Tian
Publication date: 21 April 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-58150-3_43
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
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)
Cites Work
- Title not available (Why is that?)
- Least squares quantization in PCM
- Clustering for metric and nonmetric distance measures
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Turning Big data into tiny data: Constant-size coresets for k-means, PCA and projective clustering
- An iterative row-action method for interval convex programming
- On the Optimality of Conditional Expectation as a Bregman Predictor
- A local search approximation algorithm for k-means clustering
- Title not available (Why is that?)
Cited In (2)
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)