Clustering problems on sliding windows

DOI10.1137/1.9781611974331.CH95MaRDI QIDQ4575678zbMATH OpenOpenAlexFDO

Authors Vladimir Braverman, Harry Lang, Keith Levin, Morteza Monemizadeh

Publication date 16 July 2018

Published in Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611974331.ch95

Mathematics Subject Classification ID

Data structures (68P05) Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Recommendations

• Clustering on sliding windows in polylogarithmic space
• On Coresets for k-Median and k-Means Clustering in Metric and Euclidean Spaces and Their Applications
• scientific article; zbMATH DE number 6820208
• Algorithms for \(k\)-median clustering over distributed streams
• On coresets for k-means and k-median clustering

Cited in

(9)

• Approximation algorithm for the balanced 2-correlation clustering problem on well-proportional graphs
• Approximation algorithms for two variants of correlation clustering problem
• Symmetric norm estimation and regression on sliding windows
• Algorithms for \(k\)-median clustering over distributed streams
• Accurate low-space approximation of metric k-median for insertion-only streams
• New algorithms for distributed sliding windows
• Clustering on sliding windows in polylogarithmic space
• Improved Algorithms for Time Decay Streams
• Approximation algorithm for min-max correlation clustering problem with penalties

This page was built for publication: Clustering problems on sliding windows

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