Smaller coresets for k-median and k-means clustering

DOI10.1145/1064092.1064114zbMATH Open1380.68398OpenAlexW1977983731MaRDI QIDQ5370604FDOQ5370604

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

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

zbMATH Keywords

clusteringcoresets

Mathematics Subject Classification ID

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

Cited In (23)

• Smaller coresets for \(k\)-median and \(k\)-means clustering
• Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering
• Attainable accuracy guarantee for the \(k\)-medians clustering in [0, 1]
• Probabilistic \(k\)-median clustering in data streams
• Probabilistic \(k\)-median clustering in data streams
• Single facility collection depots location problem in the plane
• On Coresets for k-Median and k-Means Clustering in Metric and Euclidean Spaces and Their Applications
• 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
• On the sensitivity of shape fitting problems
• A novel prediction method of complex univariate time series based on \(k\)-means clustering
• Coresets for clustering in geometric intersection graphs
• On the \(k\)-means/median cost function
• How to get close to the median shape
• Facility Location in Dynamic Geometric Data Streams
• A simple \(D^2\)-sampling based PTAS for \(k\)-means and other clustering problems
• Clustering through continuous facility location problems
• Local Search Yields a PTAS for $k$-Means in Doubling Metrics
• A FAST k-MEANS IMPLEMENTATION USING CORESETS
• Coresets and approximate clustering for Bregman divergences
• Title not available (Why is that?)
• Core-sets: updated survey

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 Q5370604)