Accelerating EM for large databases

DOI10.1023/A:1017986506241zbMath1052.68030MaRDI QIDQ5959949

David Heckerman, Christopher Meek, Bo Thiesson

Publication date: 11 April 2002

Published in: Machine Learning (Search for Journal in Brave)

zbMATH Keywords

clusteringdata blockingexpectation maximization algorithmmixture models

Mathematics Subject Classification ID

Database theory (68P15)

Related Items (8)

Speed-up for the expectation-maximization algorithm for clustering categorical data ⋮ Estimating random-intercept models on data streams ⋮ Data compression by volume prototypes for streaming data ⋮ Speeding up the EM algorithm for mixture model-based segmentation of magnetic resonance images ⋮ Convergence analysis of an accelerated expectation-maximization algorithm for ill-posed integral equations ⋮ On Casting Random-Effects Models in a Survival Framework ⋮ Estimating multilevel models on data streams ⋮ Convergence analysis of the loping OS-EM algorithm for noisy data

This page was built for publication: Accelerating EM for large databases