The space complexity of pass-efficient algorithms for clustering

DOI10.1145/1109557.1109685zbMath1194.62085OpenAlexW1487528023MaRDI QIDQ3583430

Kevin L. Chang, Ravindran Kannan

Publication date: 16 August 2010

Published in: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1109557.1109685

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Computer aspects of numerical algorithms (65Y99)

Related Items (2)

Multiple Pass Streaming Algorithms for Learning Mixtures of Distributions in ${\mathbb R}^d$ ⋮ Multiple pass streaming algorithms for learning mixtures of distributions in \(\mathbb R^d\)

This page was built for publication: The space complexity of pass-efficient algorithms for clustering