Pass-efficient algorithms for learning mixtures of uniform distributions

DOI10.1137/060678890MaRDI QIDQ3575149zbMATH OpenOpenAlexFDO

Authors Kevin Chang, R. Kannan

Publication date 7 July 2010

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/fb12745d80efdb3b283d51059255f5c36c31de95

zbMATH Keywords

machine learningalgorithmstreamingmassive data set

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Computational learning theory (68Q32) Randomized algorithms (68W20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• 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$
• The space complexity of pass-efficient algorithms for clustering
• Efficiently learning mixtures of two Gaussians
• Better streaming algorithms for clustering problems

Cited in

(3)

• The space complexity of pass-efficient algorithms for clustering
• 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: Pass-efficient algorithms for learning mixtures of uniform distributions

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