On approximate geometric \(k\)-clustering
From MaRDI portal
Publication:1577548
DOI10.1007/s004540010019zbMath0959.68126OpenAlexW1998905999MaRDI QIDQ1577548
Publication date: 24 August 2000
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004540010019
Related Items (28)
A refined approximation for Euclidean \(k\)-means ⋮ Linear-size universal discretization of geometric center-based problems in fixed dimensions ⋮ Randomized Spectral Clustering in Large-Scale Stochastic Block Models ⋮ Unnamed Item ⋮ Clustering through continuous facility location problems ⋮ An exact algorithm for stable instances of the \(k\)-means problem with penalties in fixed-dimensional Euclidean space ⋮ A local search approximation algorithm for \(k\)-means clustering ⋮ Effective Heuristic Techniques for Combined Robust Clustering Problem ⋮ Local search approximation algorithms for the \(k\)-means problem with penalties ⋮ Approximation algorithm for squared metric facility location problem with nonuniform capacities ⋮ Faster algorithms for the constrained \(k\)-means problem ⋮ Better Guarantees for $k$-Means and Euclidean $k$-Median by Primal-Dual Algorithms ⋮ Approximation algorithms for spherical \(k\)-means problem using local search scheme ⋮ A Streaming Algorithm for k-Means with Approximate Coreset ⋮ Local Search Yields a PTAS for $k$-Means in Doubling Metrics ⋮ A simple \(D^2\)-sampling based PTAS for \(k\)-means and other clustering problems ⋮ An efficient \(K\)-means clustering algorithm for tall data ⋮ Unnamed Item ⋮ Quantization-based clustering algorithm ⋮ Local search approximation algorithms for the sum of squares facility location problems ⋮ A FAST k-MEANS IMPLEMENTATION USING CORESETS ⋮ A unified framework for clustering constrained data without locality property ⋮ Sublinear‐time approximation algorithms for clustering via random sampling ⋮ A linear time algorithm for approximate 2-means clustering ⋮ Unnamed Item ⋮ A FAST IMPLEMENTATION OF THE ISODATA CLUSTERING ALGORITHM ⋮ Unnamed Item ⋮ K-means clustering via a nonconvex optimization approach
This page was built for publication: On approximate geometric \(k\)-clustering
