Algorithms for k-median Clustering over Distributed Streams

DOI10.1007/978-3-319-42634-1_43zbMath1476.68101OpenAlexW2484167881MaRDI QIDQ2817895

N. V. Vinodchandran, Sutanu Gayen

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) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Continuous Monitoring of Distributed Data Streams Over a Time-based Sliding Window
• Algorithms for distributed functional monitoring
• A new greedy approach for facility location problems
• On coresets for k-means and k-median clustering
• Better streaming algorithms for clustering problems
• Coresets in dynamic geometric data streams
• Clustering on Sliding Windows in Polylogarithmic Space.
• Continuous sampling from distributed streams
• Tight bounds for distributed functional monitoring

This page was built for publication: Algorithms for k-median Clustering over Distributed Streams