Algorithms for k-median clustering over distributed streams
DOI10.1007/978-3-319-42634-1_43zbMATH Open1476.68101OpenAlexW2484167881MaRDI QIDQ2817895FDOQ2817895
Authors: Sutanu Gayen, N. V. Vinodchandran 
Publication date: 2 September 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-42634-1_43
Recommendations
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Online algorithms; streaming algorithms (68W27) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Approximation algorithms (68W25)
Cites Work
- Continuous sampling from distributed streams
- A new greedy approach for facility location problems
- Algorithms for distributed functional monitoring
- On coresets for k-means and k-median clustering
- Coresets in dynamic geometric data streams
- Better streaming algorithms for clustering problems
- Tight bounds for distributed functional monitoring
- Streaming \(k\)-means on well-clusterable data
- Continuous Monitoring of Distributed Data Streams Over a Time-based Sliding Window
- Clustering on sliding windows in polylogarithmic space
Cited In (9)
- Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity
- Better streaming algorithms for clustering problems
- Metric \(k\)-median clustering in insertion-only streams
- Clustering problems on sliding windows
- New algorithms for distributed sliding windows
- Clustering on sliding windows in polylogarithmic space
- Near-optimal clustering in the \(k\)-machine model
- The distributed algorithms for the lower-bounded \(k\)-center clustering in metric space
- A fast and recursive algorithm for clustering large datasets with \(k\)-medians
This page was built for publication: Algorithms for \(k\)-median clustering over distributed streams
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2817895)
