Calibrated initials for an EM applied to recursive models of categorical variables.

DOI10.1016/S0167-9473(01)00105-0zbMath1072.65504OpenAlexW2070580011MaRDI QIDQ1606104

Sung-Ho Kim

Publication date: 31 July 2002

Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-9473(01)00105-0

zbMATH Keywords

Euclidean distanceModel complexityDirected acyclic graphCalibrated initial valuesModel structureRandomly selected initial valuesRoot nodes and terminal nodesSubjective probabilityWell-calibrated

Mathematics Subject Classification ID

Related Items (3)

Model similarity and rank-order based classification of Bayesian networks ⋮ A divide-and-conquer approach in applying EM for large recursive models with incomplete categorical data ⋮ Fluctuation of estimates in an EM procedure for categorical data

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the convergence properties of the EM algorithm
• Calibration and refinement for classification trees
• Bayesian analysis in expert systems. With comments and a rejoinder by the authors
• Graphical and Recursive Models for Contingency Tables

This page was built for publication: Calibrated initials for an EM applied to recursive models of categorical variables.