Accelerating EM for large databases

DOI10.1023/A:1017986506241zbMATH Open1052.68030MaRDI QIDQ5959949FDOQ5959949

Authors: Bo Thiesson, Christopher Meek, David Heckerman 

Publication date: 11 April 2002

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

Recommendations

• scientific article
• Scalable probabilistic clustering
• scientific article; zbMATH DE number 1086058
• AN ACCELERATED ALGORITHM FOR DENSITY ESTIMATION IN LARGE DATABASES USING GAUSSIAN MIXTURES
• scientific article; zbMATH DE number 1222290

zbMATH Keywords

clusteringmixture modelsexpectation maximization algorithmdata blocking

Mathematics Subject Classification ID

Database theory (68P15)

Cited In (17)

• Scalable probabilistic clustering
• Title not available (Why is that?)
• Classification of large data sets with mixture models via sufficient EM
• Title not available (Why is that?)
• Estimating multilevel models on data streams
• Convergence analysis of the loping OS-EM algorithm for noisy data
• Use of EM algorithm for data reduction under sparsity assumption
• Speeding up the EM algorithm for mixture model-based segmentation of magnetic resonance images
• Title not available (Why is that?)
• Convergence analysis of an accelerated expectation-maximization algorithm for ill-posed integral equations
• Estimating random-intercept models on data streams
• Speed-up for the expectation-maximization algorithm for clustering categorical data
• An Asynchronous Distributed Expectation Maximization Algorithm for Massive Data: The DEM Algorithm
• On Casting Random-Effects Models in a Survival Framework
• Data compression by volume prototypes for streaming data
• AN ACCELERATED ALGORITHM FOR DENSITY ESTIMATION IN LARGE DATABASES USING GAUSSIAN MIXTURES
• 10.1162/153244302760200678

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

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