Smaller coresets for k-median and k-means clustering
From MaRDI portal
Publication:5370604
DOI10.1145/1064092.1064114zbMath1380.68398OpenAlexW1977983731MaRDI QIDQ5370604
Akash Kushal, Sariel Har-Peled
Publication date: 20 October 2017
Published in: Proceedings of the twenty-first annual symposium on Computational geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1064092.1064114
Related Items (10)
Unnamed Item ⋮ A novel prediction method of complex univariate time series based on \(k\)-means clustering ⋮ Clustering through continuous facility location problems ⋮ How to get close to the median shape ⋮ On the \(k\)-means/median cost function ⋮ Facility Location in Dynamic Geometric Data Streams ⋮ Core-Sets: Updated Survey ⋮ 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 ⋮ Single facility collection depots location problem in the plane
This page was built for publication: Smaller coresets for k-median and k-means clustering
