Smaller coresets for k-median and k-means clustering

DOI10.1007/S00454-006-1271-XzbMATH Open1106.68112OpenAlexW1978906111MaRDI QIDQ866968FDOQ866968

Authors: 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

Recommendations

• Smaller coresets for \(k\)-median and \(k\)-means clustering
• On coresets for k-means and k-median clustering
• On Coresets for k-Median and k-Means Clustering in Metric and Euclidean Spaces and Their Applications
• A PTAS for k-means clustering based on weak coresets
• Probabilistic \(k\)-median clustering in data streams

Mathematics Subject Classification ID

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

Cited In (34)

• Streaming with minimum space: an algorithm for covering by two congruent balls
• Temporal clustering
• Title not available (Why is that?)
• Coresets for Fuzzy K-Means with Applications
• Sublinear-time Algorithms
• On the fixed-parameter tractability of capacitated clustering
• Dynamic coresets
• Practical methods for shape fitting and kinetic data structures using coresets
• Small space representations for metric min-sum \(k\)-clustering and their applications
• Accurate low-space approximation of metric \(k\)-median for insertion-only streams
• On coresets for fair clustering in metric and Euclidean spaces and their applications
• Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering
• Title not available (Why is that?)
• Metric \(k\)-median clustering in insertion-only streams
• A strong coreset algorithm to accelerate OPF as a graph-based machine learning in large-scale problems
• Coresets for \((k, \ell ) \)-median clustering under the Fréchet distance
• Probabilistic \(k\)-median clustering in data streams
• Probabilistic \(k\)-median clustering in data streams
• Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics
• On Coresets for k-Median and k-Means Clustering in Metric and Euclidean Spaces and Their Applications
• Turning Grain Maps into Diagrams
• Coresets for clustering in excluded-minor graphs and beyond
• On coresets for k-means and k-median clustering
• A PTAS for k-means clustering based on weak coresets
• Coresets for clustering in geometric intersection graphs
• Approximate range queries for clustering
• Aggregation error for location models: Survey and analysis
• Tight bounds for the subspace sketch problem with applications
• Clustering with faulty centers
• Learning big (image) data via coresets for dictionaries
• Linear-time approximation scheme for \(k\)-means clustering of axis-parallel affine subspaces
• Smaller coresets for \(k\)-median and \(k\)-means clustering
• A FAST k-MEANS IMPLEMENTATION USING CORESETS
• A novel method for optimizing spectral rotation embedding \(K\)-means with coordinate descent

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q866968)