Speed-up for the expectation-maximization algorithm for clustering categorical data
From MaRDI portal
Publication:2385490
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
Cites work
- scientific article; zbMATH DE number 4104359 (Why is no real title available?)
- scientific article; zbMATH DE number 3567782 (Why is no real title available?)
- scientific article; zbMATH DE number 1222290 (Why is no real title available?)
- scientific article; zbMATH DE number 1086057 (Why is no real title available?)
- scientific article; zbMATH DE number 1149880 (Why is no real title available?)
- A classification EM algorithm for clustering and two stochastic versions
- Accelerating EM for large databases
- Clustering Criteria and Multivariate Normal Mixtures
- Comparison of the mixture and the classification maximum likelihood in cluster analysis with binary data
- Conjugate Gradient Acceleration of the EM Algorithm
- Estimating the components of a mixture of normal distributions
- Finite mixture models
- On the optimality of the simple Bayesian classifier under zero-one loss
Cited in
(5)- A classification EM algorithm for binned data
- A PROBABILISTIC SELF-ORGANIZING MAP FOR BINARY DATA TOPOGRAPHIC CLUSTERING
- scientific article; zbMATH DE number 2079485 (Why is no real title available?)
- scientific article; zbMATH DE number 2033144 (Why is no real title available?)
- A hybrid EM approach to spatial clustering
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)