The spherical \(k\)-means++ algorithm via local search scheme

DOI10.1007/s10878-021-00737-xzbMath1504.90136OpenAlexW3154676932MaRDI QIDQ2084616

Xiaoyun Tian, Ling Gai, Dong-lei Du, 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-00737-x

zbMATH Keywords

approximation algorithmlocal searchseeding algorithmspherical \(k\)-means

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A local search approximation algorithm for \(k\)-means clustering
• Approximation algorithms for spherical \(k\)-means problem using local search scheme
• The seeding algorithms for spherical \(k\)-means clustering
• Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering
• Least squares quantization in PCM
• Spherical k-Means++ Clustering
• Concept decompositions for large sparse text data using clustering

This page was built for publication: The spherical \(k\)-means++ algorithm via local search scheme