An improved data stream algorithm for clustering
From MaRDI portal
Publication:904105
DOI10.1016/j.comgeo.2015.06.003zbMath1335.65031OpenAlexW2215609590MaRDI QIDQ904105
Publication date: 15 January 2016
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2015.06.003
Related Items (4)
Small Space Stream Summary for Matroid Center ⋮ A streaming algorithm for 2-center with outliers in high dimensions ⋮ Covering convex polygons by two congruent disks ⋮ Covering convex polygons by two congruent disks
Cites Work
- Unnamed Item
- Unnamed Item
- Streaming and dynamic algorithms for minimum enclosing balls in high dimensions
- Streaming with minimum space: an algorithm for covering by two congruent balls
- Data streams. Models and algorithms.
- Adaptive sampling for geometric problems over data streams
- COMPUTING k CENTERS OVER STREAMING DATA FOR SMALL k
- On the Complexity of Some Common Geometric Location Problems
- Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity
- Incremental Clustering and Dynamic Information Retrieval
- Data mining. Concepts and techniques
This page was built for publication: An improved data stream algorithm for clustering