Multiple Pass Streaming Algorithms for Learning Mixtures of Distributions in ${\mathbb R}^d$

DOI10.1007/978-3-540-75225-7_19zbMath1142.68387OpenAlexW2177650266MaRDI QIDQ3520061

Kevin L. Chang

Publication date: 19 August 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-75225-7_19

Mathematics Subject Classification ID

Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• A spectral algorithm for learning mixture models
• Selection and sorting with limited storage
• The space complexity of approximating the frequency moments
• Learning mixtures of separated nonspherical Gaussians
• Stable distributions, pseudorandom generators, embeddings, and data stream computation
• Fast, small-space algorithms for approximate histogram maintenance
• Streaming and sublinear approximation of entropy and information distances
• The space complexity of pass-efficient algorithms for clustering
• Learning Theory

This page was built for publication: Multiple Pass Streaming Algorithms for Learning Mixtures of Distributions in ${\mathbb R}^d$