Algorithms for k-median clustering over distributed streams

DOI10.1007/978-3-319-42634-1_43MaRDI QIDQ2817895zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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)

Recommendations

• Better streaming algorithms for clustering problems
• New algorithms for distributed sliding windows
• Clustering problems on sliding windows
• Clustering on sliding windows in polylogarithmic space
• scientific article; zbMATH DE number 6820208

Cites work

• A new greedy approach for facility location problems
• Algorithms for distributed functional monitoring
• Better streaming algorithms for clustering problems
• Clustering on sliding windows in polylogarithmic space
• Continuous Monitoring of Distributed Data Streams Over a Time-based Sliding Window
• Continuous sampling from distributed streams
• Coresets in dynamic geometric data streams
• On coresets for k-means and k-median clustering
• Streaming \(k\)-means on well-clusterable data
• Tight bounds for distributed functional monitoring

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
• A fast and recursive algorithm for clustering large datasets with \(k\)-medians
• The distributed algorithms for the lower-bounded \(k\)-center clustering in metric space

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)