Multiple pass streaming algorithms for learning mixtures of distributions in \(\mathbb R^d\)

DOI10.1016/j.tcs.2009.01.043zbMath1183.68467OpenAlexW2123194956MaRDI QIDQ1017656

Kevin L. Chang

Publication date: 12 May 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.01.043

zbMATH Keywords

computational learning theorymachine learningmixture modelstreaming algorithm

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) 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
• Sharper bounds for Gaussian and empirical processes
• 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
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities

This page was built for publication: Multiple pass streaming algorithms for learning mixtures of distributions in \(\mathbb R^d\)