Calibrated initials for an EM applied to recursive models of categorical variables.
From MaRDI portal
Calibrated initial valuesDirected acyclic graphEuclidean distanceModel complexityModel structureRandomly selected initial valuesRoot nodes and terminal nodesSubjective probabilityWell-calibrated
Recommendations
- Fluctuation of estimates in an EM procedure for categorical data
- Hyper-EM for large recursive models of categorical variables.
- A divide-and-conquer approach in applying EM for large recursive models with incomplete categorical data
- Choosing initial values for the EM algorithm for finite mixtures
- Choosing starting values for the EM algorithm for getting the highest likelihood in multivariate Gaussian mixture models
Cites work
- Bayesian analysis in expert systems. With comments and a rejoinder by the authors
- Calibration and refinement for classification trees
- Graphical and Recursive Models for Contingency Tables
- scientific article; zbMATH DE number 3519741 (Why is no real title available?)
- scientific article; zbMATH DE number 3567782 (Why is no real title available?)
- scientific article; zbMATH DE number 3635280 (Why is no real title available?)
- scientific article; zbMATH DE number 3434895 (Why is no real title available?)
- On the convergence properties of the EM algorithm
Cited in
(4)- Hyper-EM for large recursive models of categorical variables.
- Model similarity and rank-order based classification of Bayesian networks
- Fluctuation of estimates in an EM procedure for categorical data
- A divide-and-conquer approach in applying EM for large recursive models with incomplete categorical data
This page was built for publication: Calibrated initials for an EM applied to recursive models of categorical variables.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1606104)
