Multiple pass streaming algorithms for learning mixtures of distributions in R^d
From MaRDI portal
(Redirected from Publication:1017656)
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\)
Recommendations
- Multiple Pass Streaming Algorithms for Learning Mixtures of Distributions in ${\mathbb R}^d$
- Pass-efficient algorithms for learning mixtures of uniform distributions
- The space complexity of pass-efficient algorithms for clustering
- Learning mixtures of arbitrary distributions over large discrete domains
- A spectral algorithm for learning mixture models
Cites work
- A spectral algorithm for learning mixture models
- Fast, small-space algorithms for approximate histogram maintenance
- Learning Theory
- Learning mixtures of separated nonspherical Gaussians
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Selection and sorting with limited storage
- Sharper bounds for Gaussian and empirical processes
- Stable distributions, pseudorandom generators, embeddings, and data stream computation
- Streaming and sublinear approximation of entropy and information distances
- The space complexity of approximating the frequency moments
- The space complexity of pass-efficient algorithms for clustering
Cited in
(3)
This page was built for publication: Multiple pass streaming algorithms for learning mixtures of distributions in \(\mathbb R^d\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1017656)
