The Parallel Seeding Algorithm for k-Means Problem with Penalties

DOI10.1142/S0217595920400059zbMath1459.90185MaRDI QIDQ5149519

Dongmei Zhang, Jun Yue, Da-Chuan Xu, Min Li

Publication date: 11 February 2021

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

zbMATH Keywords

approximation algorithmparallel\(k\)-meanspenaltyseeding algorithm

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (1)

The provably good parallel seeding algorithms for the k‐means problem with penalties

Uses Software

• apcluster
• APCluster

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Clustering by Passing Messages Between Data Points
• 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
• 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
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• Adaptive Sampling for k-Means Clustering
• Least squares quantization in PCM
• Better Guarantees for $k$-Means and Euclidean $k$-Median by Primal-Dual Algorithms
• The effectiveness of lloyd-type methods for the k-means problem

This page was built for publication: The Parallel Seeding Algorithm for k-Means Problem with Penalties