The spherical k-means++ algorithm via local search
From MaRDI portal
Publication:2039652
DOI10.1007/978-3-030-57602-8_12zbMATH Open1482.68220OpenAlexW3047749157MaRDI QIDQ2039652FDOQ2039652
Authors: Xiaoyun Tian, Ling Gai, Dachuan Xu, Donglei Du
Publication date: 5 July 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-57602-8_12
Recommendations
- The spherical \(k\)-means++ algorithm via local search scheme
- Approximation algorithms for spherical \(k\)-means problem using local search scheme
- Spherical k-Means++ Clustering
- The seeding algorithms for spherical \(k\)-means clustering
- The seeding algorithm for spherical \(k\)-means clustering with penalties
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Computational aspects of data analysis and big data (68T09) Approximation algorithms (68W25)
Cites Work
- Title not available (Why is that?)
- Least squares quantization in PCM
- 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
- Concept decompositions for large sparse text data using clustering
- A local search approximation algorithm for \(k\)-means clustering
- Explanation in artificial intelligence: insights from the social sciences
- The seeding algorithms for spherical \(k\)-means clustering
- Better guarantees for \(k\)-means and Euclidean \(k\)-median by primal-dual algorithms
- Spherical k-Means++ Clustering
- Local search approximation algorithms for the spherical \(k\)-means problem
Cited In (14)
- The seeding algorithms for spherical \(k\)-means clustering
- Spherical k-Means++ Clustering
- The seeding algorithm for spherical \(k\)-means clustering with penalties
- An improved Bregman \(k\)-means++ algorithm via local search
- Improved local search algorithms for Bregman \(k\)-means and its variants
- The spherical \(k\)-means++ algorithm via local search scheme
- Local search approximation algorithms for the spherical \(k\)-means problem
- Partitional clustering via successive transportation problems
- Approximation algorithms for spherical \(k\)-means problem using local search scheme
- Local search algorithm for the spherical \(k\)-means problem with outliers
- Approximation Algorithms for Spherical k-Means Problem with Penalties Using Local Search Techniques
- The seeding algorithm for spherical \(k\)-means clustering with penalties
- An approximation algorithm for the spherical \(k\)-means problem with outliers by local search
- Approximation algorithm for spherical \(k\)-means problem with penalty
This page was built for publication: The spherical \(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 Q2039652)