Smaller coresets for \(k\)-median and \(k\)-means clustering

DOI10.1007/s00454-006-1271-xzbMath1106.68112OpenAlexW1978906111MaRDI QIDQ866968

Sariel Har-Peled, Akash Kushal

Publication date: 14 February 2007

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-006-1271-x

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (27)

A strong coreset algorithm to accelerate OPF as a graph-based machine learning in large-scale problems ⋮ Dynamic coresets ⋮ Streaming with minimum space: an algorithm for covering by two congruent balls ⋮ Clustering with faulty centers ⋮ Coresets for \((k, \ell ) \)-median clustering under the Fréchet distance ⋮ Linear-time approximation scheme for \(k\)-means clustering of axis-parallel affine subspaces ⋮ A novel method for optimizing spectral rotation embedding \(K\)-means with coordinate descent ⋮ On coresets for fair clustering in metric and Euclidean spaces and their applications ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Turning Grain Maps into Diagrams ⋮ Accurate Low-Space Approximation of Metric k-Median for Insertion-Only Streams ⋮ Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics ⋮ Metric \(k\)-median clustering in insertion-only streams ⋮ Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering ⋮ Small space representations for metric min-sum \(k\)-clustering and their applications ⋮ Sublinear-time Algorithms ⋮ Unnamed Item ⋮ A FAST k-MEANS IMPLEMENTATION USING CORESETS ⋮ Learning big (image) data via coresets for dictionaries ⋮ Practical methods for shape fitting and kinetic data structures using coresets ⋮ Unnamed Item ⋮ Coresets for Fuzzy K-Means with Applications ⋮ Aggregation error for location models: Survey and analysis ⋮ Approximate Range Queries for Clustering ⋮ Tight Bounds for the Subspace Sketch Problem with Applications ⋮ Probabilistic \(k\)-median clustering in data streams

This page was built for publication: Smaller coresets for \(k\)-median and \(k\)-means clustering