An improved data stream algorithm for clustering

DOI10.1016/J.COMGEO.2015.06.003MaRDI QIDQ904105zbMATH OpenOpenAlexFDO

Authors Sang-Sub Kim, Hee-Kap Ahn

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

zbMATH Keywords

computational geometrystreaming algorithmsEuclidean \(k\)-center problemEuclidean \(k\)-clustering

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• An improved data stream algorithm for clustering
• Computing \(k\) centers over streaming data for small \(k\)
• Computing \(k\)-center over streaming data for small \(k\)
• On the Complexity of Approximation Streaming Algorithms for the k-Center Problem
• An adaptive probabilistic algorithm for online \(k\)-center clustering

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 6297803 (Why is no real title available?)
• Adaptive sampling for geometric problems over data streams
• Computing \(k\) centers over streaming data for small \(k\)
• Data mining. Concepts and techniques
• Data streams. Models and algorithms.
• Incremental Clustering and Dynamic Information Retrieval
• On the Complexity of Some Common Geometric Location Problems
• Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity
• Streaming and dynamic algorithms for minimum enclosing balls in high dimensions
• Streaming with minimum space: an algorithm for covering by two congruent balls

Cited in

(15)

• scientific article; zbMATH DE number 5811661 (Why is no real title available?)
• An improved data stream algorithm for clustering
• scientific article; zbMATH DE number 6874937 (Why is no real title available?)
• Small Space Stream Summary for Matroid Center
• Computing \(k\) centers over streaming data for small \(k\)
• On the Complexity of Approximation Streaming Algorithms for the k-Center Problem
• 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
• Computing \(k\)-center over streaming data for small \(k\)
• Tight lower bounds for approximate \& exact \(k\)-center in \(\mathbb{R}^d\)
• An adaptive probabilistic algorithm for online \(k\)-center clustering
• Data stream clustering
• Better streaming algorithms for clustering problems
• \((1 + \varepsilon)\)-approximation for facility location in data streams

This page was built for publication: An improved data stream algorithm for clustering

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