The space complexity of pass-efficient algorithms for clustering

DOI10.1145/1109557.1109685MaRDI QIDQ3583430zbMATH OpenOpenAlexFDO

Authors Kevin Chang, R. 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)

Recommendations

• Pass-efficient algorithms for learning mixtures of uniform distributions
• 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\)
• Better streaming algorithms for clustering problems
• Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity

Cited in

(3)

• 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$
• Pass-efficient algorithms for learning mixtures of uniform distributions

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

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