A local search approximation algorithm for k-means clustering
From MaRDI portal
Publication:4557531
DOI10.1145/513400.513402zbMath1414.68128OpenAlexW2199495299MaRDI QIDQ4557531
Angela Y. Wu, Ruth Silverman, Tapas Kanungo, Christine D. Piatko, David M. Mount, Nathan S. Netanyahu
Publication date: 23 November 2018
Published in: Proceedings of the eighteenth annual symposium on Computational geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/513400.513402
Searching and sorting (68P10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Related Items (24)
The Ratio-Cut Polytope and K-Means Clustering ⋮ Handling Biological Complexity Using Kron Reduction ⋮ Clustering through continuous facility location problems ⋮ Improved results on geometric hitting set problems ⋮ Universal Algorithms for Clustering Problems ⋮ Eigenvalues of quaternion tensors with applications to color video processing ⋮ On the discrepancy between Kleinberg's clustering axioms and \(k\)-means clustering algorithm behavior ⋮ New algorithms for a simple measure of network partitioning ⋮ A minimum spanning tree equipartition algorithm for microaggregation ⋮ Dimensionality-Dependent Generalization Bounds for k-Dimensional Coding Schemes ⋮ Approximating Spectral Clustering via Sampling: A Review ⋮ Semi-Supervised Algorithms for Approximately Optimal and Accurate Clustering ⋮ An efficient \(K\)-means clustering algorithm for tall data ⋮ FPT Approximation for Constrained Metric k-Median/Means ⋮ An improved Bregman \(k\)-means++ algorithm via local search ⋮ Unnamed Item ⋮ New algorithms for a simple measure of network partitioning ⋮ Greedy Strategy Works for k-Center Clustering with Outliers and Coreset Construction ⋮ A general framework for efficient clustering of large datasets based on activity detection ⋮ Neighborhood granules and rough rule-base in tracking ⋮ Heterogeneous distributed big data clustering on sparse grids ⋮ Improved local search algorithms for Bregman \(k\)-means and its variants ⋮ Unnamed Item ⋮ K-means clustering via a nonconvex optimization approach
This page was built for publication: A local search approximation algorithm for k-means clustering