Approximation Algorithms for Spherical k-Means Problem with Penalties Using Local Search Techniques

DOI10.1142/s0217595922400140OpenAlexW4311326279MaRDI QIDQ6053502

Ling Gai, Dongmei Zhang, Xiaoyun Tian, Yicheng Xu

Publication date: 19 October 2023

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595922400140

zbMATH Keywords

approximation algorithmlocal searchoutlierspherical \(k\)-meansadapted clustering

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Local search algorithm for universal facility location problem with linear penalties
• A local search approximation algorithm for \(k\)-means clustering
• The seeding algorithm for spherical \(k\)-means clustering with penalties
• Approximation algorithm for spherical \(k\)-means problem with penalty
• Approximation algorithms for spherical \(k\)-means problem using local search scheme
• The seeding algorithms for spherical \(k\)-means clustering
• An improved approximation algorithm for the \(k\)-means problem with penalties
• Local search approximation algorithms for the \(k\)-means problem with penalties
• Improved approximation algorithm for universal facility location problem with linear penalties
• Least squares quantization in PCM
• Approximating Robust Parameterized Submodular Function Maximization in Large-Scales
• Spherical k-Means++ Clustering
• Concept decompositions for large sparse text data using clustering

This page was built for publication: Approximation Algorithms for Spherical k-Means Problem with Penalties Using Local Search Techniques