Speed-up for the expectation-maximization algorithm for clustering categorical data
From MaRDI portal
Publication:2385490
DOI10.1007/S10898-006-9059-3zbMATH Open1119.62059OpenAlexW1966215428MaRDI QIDQ2385490FDOQ2385490
Publication date: 12 October 2007
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-006-9059-3
Recommendations
- scientific article; zbMATH DE number 2088095
- Simple and Globally Convergent Methods for Accelerating the Convergence of Any EM Algorithm
- An experimental comparison of model-based clustering methods
- Speeding up the EM algorithm for mixture model-based segmentation of magnetic resonance images
- scientific article; zbMATH DE number 2033144
Point estimation (62F10) Classification and discrimination; cluster analysis (statistical aspects) (62H30)
Cites Work
- Title not available (Why is that?)
- Finite mixture models
- Comparison of the mixture and the classification maximum likelihood in cluster analysis with binary data
- A classification EM algorithm for clustering and two stochastic versions
- Clustering Criteria and Multivariate Normal Mixtures
- Estimating the components of a mixture of normal distributions
- Title not available (Why is that?)
- Conjugate Gradient Acceleration of the EM Algorithm
- Title not available (Why is that?)
- On the optimality of the simple Bayesian classifier under zero-one loss
- Title not available (Why is that?)
- Title not available (Why is that?)
- Accelerating EM for large databases
Cited In (3)
Uses Software
This page was built for publication: Speed-up for the expectation-maximization algorithm for clustering categorical data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2385490)
