Coresets in dynamic geometric data streams

DOI10.1145/1060590.1060622MaRDI QIDQ3581392zbMATH OpenOpenAlexFDO

Authors Gereon Frahling, Christian Sohler

Publication date 16 August 2010

Published in Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1060590.1060622

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25)

Cited in

(29)

• A strong coreset algorithm to accelerate OPF as a graph-based machine learning in large-scale problems
• Probabilistic k-median clustering in data streams
• Algorithms for \(k\)-median clustering over distributed streams
• Streaming Embeddings with Slack
• Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering
• Sublinear‐time approximation algorithms for clustering via random sampling
• Facility Location in Dynamic Geometric Data Streams
• An Almost Space-Optimal Streaming Algorithm for Coresets in Fixed Dimensions
• Training Gaussian mixture models at scale via coresets
• A simple \(D^2\)-sampling based PTAS for \(k\)-means and other clustering problems
• Sublinear-time Algorithms
• On low-risk heavy hitters and sparse recovery schemes
• Online facility location with deletions
• On the fixed-parameter tractability of capacitated clustering
• An almost space-optimal streaming algorithm for coresets in fixed dimensions
• scientific article; zbMATH DE number 7053290 (Why is no real title available?)
• scientific article; zbMATH DE number 7651196 (Why is no real title available?)
• scientific article; zbMATH DE number 7650129 (Why is no real title available?)
• On coresets for fair clustering in metric and Euclidean spaces and their applications
• On streaming algorithms for geometric independent set and clique
• Streaming Euclidean MST to a constant factor
• Streaming Euclidean \textsc{Max-Cut}: dimension vs data reduction
• Turning big data into tiny data: coresets for unsupervised learning problems
• An empirical evaluation of k-means coresets
• Streaming algorithms for geometric Steiner forest
• On coresets for fair clustering in metric and Euclidean spaces and their applications
• Dynamic streaming algorithms for geometric independent set
• Dynamic coresets
• Small space representations for metric min-sum k-clustering and their applications

This page was built for publication: Coresets in dynamic geometric data streams

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