The provably good parallel seeding algorithms for the k‐means problem with penalties
From MaRDI portal
Publication:6092504
DOI10.1111/itor.12808MaRDI QIDQ6092504
No author found.
Publication date: 23 November 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Cites Work
- Improved and simplified inapproximability for \(k\)-means
- A local search approximation algorithm for \(k\)-means clustering
- Clustering large graphs via the singular value decomposition
- NP-hardness of Euclidean sum-of-squares clustering
- The seeding algorithm for \(k\)-means problem with penalties
- An improved approximation algorithm for the \(k\)-means problem with penalties
- Local search approximation algorithms for the \(k\)-means problem with penalties
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Adaptive Sampling for k-Means Clustering
- Sparse $k$-Means with $\ell_{\infty}/\ell_0$ Penalty for High-Dimensional Data Clustering
- Least squares quantization in PCM
- Good Clusterings Have Large Volume
- The Parallel Seeding Algorithm for k-Means Problem with Penalties
- K-means method for rough classification of R&D employees' performance evaluation
- An output‐oriented classification of multiple attribute decision‐making techniques based on fuzzy c‐means clustering method
- Unnamed Item
- Unnamed Item
- Unnamed Item
