Metric \(k\)-median clustering in insertion-only streams

DOI10.1016/j.dam.2021.07.025OpenAlexW3190440158MaRDI QIDQ2231758

Harry Lang, Keith Levin, Yevgeniy Rudoy, Vladimir Braverman

Publication date: 30 September 2021

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2021.07.025

zbMATH Keywords

clusteringstreaming algorithms\(k\)-median

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Artificial intelligence (68Txx) Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Smaller coresets for \(k\)-median and \(k\)-means clustering
• BICO: BIRCH Meets Coresets for k-Means Clustering
• On Coresets for k-Median and k-Means Clustering in Metric and Euclidean Spaces and Their Applications
• Approximate clustering via core-sets
• On coresets for k-means and k-median clustering
• Better streaming algorithms for clustering problems
• Decomposable searching problems I. Static-to-dynamic transformation
• Local Search Heuristics for k-Median and Facility Location Problems
• An Improved Approximation for k-median, and Positive Correlation in Budgeted Optimization
• A unified framework for approximating and clustering data

This page was built for publication: Metric \(k\)-median clustering in insertion-only streams