The spherical k-means++ algorithm via local search

DOI10.1007/978-3-030-57602-8_12MaRDI QIDQ2039652zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

approximation algorithmlocal searchseeding algorithmcosine dissimilarityspherical \(k\)-means

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Computational aspects of data analysis and big data (68T09) Approximation algorithms (68W25)

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

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 3340881 (Why is no real title available?)
• A local search approximation algorithm for \(k\)-means clustering
• Better guarantees for \(k\)-means and Euclidean \(k\)-median by primal-dual algorithms
• Concept decompositions for large sparse text data using clustering
• Explanation in artificial intelligence: insights from the social sciences
• Least squares quantization in PCM
• Local search approximation algorithms for the spherical \(k\)-means problem
• Spherical k-Means++ Clustering
• The seeding algorithms for spherical \(k\)-means clustering
• Turning big data into tiny data: constant-size coresets for \(k\)-means, PCA and projective clustering

Cited in

(14)

• Approximation Algorithms for Spherical k-Means Problem with Penalties Using Local Search Techniques
• Local search algorithm for the spherical \(k\)-means problem with outliers
• Partitional clustering via successive transportation problems
• An approximation algorithm for the spherical \(k\)-means problem with outliers by local search
• Approximation algorithm for spherical \(k\)-means problem with penalty
• The seeding algorithms for spherical \(k\)-means clustering
• Improved local search algorithms for Bregman \(k\)-means and its variants
• The spherical \(k\)-means++ algorithm via local search scheme
• Spherical k-Means++ Clustering
• Local search approximation algorithms for the spherical \(k\)-means problem
• The seeding algorithm for spherical \(k\)-means clustering with penalties
• Approximation algorithms for spherical \(k\)-means problem using local search scheme
• The seeding algorithm for spherical \(k\)-means clustering with penalties
• An improved Bregman \(k\)-means++ algorithm via local search

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)