The seeding algorithm for k-means problem with penalties

DOI10.1007/S10878-019-00450-WMaRDI QIDQ2292125zbMATH OpenOpenAlexFDO

Authors M. Li, Jun Yue, Dongmei Zhang, Peng Zhang, Dachuan Xu

Publication date 3 February 2020

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-019-00450-w

zbMATH Keywords

\(k\)-meansapproximation algorithmpenaltyseeding algorithm

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25)

Recommendations

• The Parallel Seeding Algorithm for k-Means Problem with Penalties
• The bi-criteria seeding algorithms for two variants of \(k\)-means problem
• The seeding algorithm for spherical \(k\)-means clustering with penalties
• An improved primal-dual approximation algorithm for the \(k\)-means problem with penalties
• An improved approximation algorithm for the \(k\)-means problem with penalties

Cites work

• scientific article; zbMATH DE number 6381735 (Why is no real title available?)
• A local search approximation algorithm for \(k\)-means clustering
• A local search approximation algorithm for the \(k\)-means problem with penalties
• A survey on algorithms for \(k\)-means problem and its variants
• Adaptive Sampling for k-Means Clustering
• Better guarantees for \(k\)-means and Euclidean \(k\)-median by primal-dual algorithms
• Clustering large graphs via the singular value decomposition
• How fast is the \(k\)-means method?
• Improved and simplified inapproximability for \(k\)-means
• Least squares quantization in PCM
• NP-hardness of Euclidean sum-of-squares clustering
• The effectiveness of Lloyd-type methods for the \(k\)-means problem
• The hardness of approximation of Euclidean \(k\)-means

Cited in

(16)

• An approximation algorithm based on seeding algorithm for fuzzy \(k\)-means problem with penalties
• An improved primal-dual approximation algorithm for the \(k\)-means problem with penalties
• The seeding algorithm for spherical \(k\)-means clustering with penalties
• An improved approximation algorithm for the \(k\)-means problem with penalties
• Simulated annealing for selecting optimal initial seeds in the K-means algorithm
• Effective Heuristic Techniques for Combined Robust Clustering Problem
• scientific article; zbMATH DE number 6381735 (Why is no real title available?)
• An exact algorithm for stable instances of the k-means problem with penalties in fixed-dimensional Euclidean space
• The Parallel Seeding Algorithm for k-Means Problem with Penalties
• Approximation Algorithms for Matroid and Knapsack Means Problems
• The approximation algorithm based on seeding method for functional \(k\)-means problem
• The seeding algorithm for spherical \(k\)-means clustering with penalties
• The bi-criteria seeding algorithms for two variants of \(k\)-means problem
• The provably good parallel seeding algorithms for the k‐means problem with penalties
• Approximation algorithm for spherical \(k\)-means problem with penalty
• Approximation algorithms for fuzzy \(C\)-means problem based on seeding method

This page was built for publication: The seeding algorithm for \(k\)-means problem with penalties

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2292125)