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




Related Items (24)

The Ratio-Cut Polytope and K-Means ClusteringHandling Biological Complexity Using Kron ReductionClustering through continuous facility location problemsImproved results on geometric hitting set problemsUniversal Algorithms for Clustering ProblemsEigenvalues of quaternion tensors with applications to color video processingOn the discrepancy between Kleinberg's clustering axioms and \(k\)-means clustering algorithm behaviorNew algorithms for a simple measure of network partitioningA minimum spanning tree equipartition algorithm for microaggregationDimensionality-Dependent Generalization Bounds for k-Dimensional Coding SchemesApproximating Spectral Clustering via Sampling: A ReviewSemi-Supervised Algorithms for Approximately Optimal and Accurate ClusteringAn efficient \(K\)-means clustering algorithm for tall dataFPT Approximation for Constrained Metric k-Median/MeansAn improved Bregman \(k\)-means++ algorithm via local searchUnnamed ItemNew algorithms for a simple measure of network partitioningGreedy Strategy Works for k-Center Clustering with Outliers and Coreset ConstructionA general framework for efficient clustering of large datasets based on activity detectionNeighborhood granules and rough rule-base in trackingHeterogeneous distributed big data clustering on sparse gridsImproved local search algorithms for Bregman \(k\)-means and its variantsUnnamed ItemK-means clustering via a nonconvex optimization approach




This page was built for publication: A local search approximation algorithm for k-means clustering