An approximation algorithm for the spherical \(k\)-means problem with outliers by local search
From MaRDI portal
Publication:2084618
DOI10.1007/s10878-021-00734-0zbMath1504.90138OpenAlexW3159292392MaRDI QIDQ2084618
Dongmei Zhang, Yishui Wang, Juan Zou, Chen-Chen Wu
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-00734-0
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A local search approximation algorithm for \(k\)-means clustering
- The bi-criteria seeding algorithms for two variants of \(k\)-means problem
- Approximation algorithms for spherical \(k\)-means problem using local search scheme
- The seeding algorithms for spherical \(k\)-means clustering
- The Planar k-Means Problem is NP-Hard
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- A Bi-Criteria Approximation Algorithm for k-Means
- Least squares quantization in PCM
- Approximation Schemes for Clustering with Outliers
- Spherical k-Means++ Clustering
- Concept decompositions for large sparse text data using clustering
This page was built for publication: An approximation algorithm for the spherical \(k\)-means problem with outliers by local search