The TM algorithm for maximising a conditional likelihood function.

DOI10.1093/BIOMET/88.4.961zbMATH Open1099.62526OpenAlexW2113772173WikidataQ57394038 ScholiaQ57394038MaRDI QIDQ2773179FDOQ2773179

Authors: David Edwards, Steffen Lauritzen 

Publication date: 2001

Published in: Biometrika (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/c140cc456d0fc09dc83b277c4b2e4b300bd6c1af

Recommendations

• Maximum likelihood estimation via the ECM algorithm: A general framework
• Maximization by Parts in Likelihood Inference
• The EM algorithm for graphical association models with missing data
• Iterative conditional fitting for discrete chain graph models.
• The ECME algorithm: A simple extension of EM and ECM with faster monotone convergence

zbMATH Keywords

Graphical modelLogistic regressionConditional inferenceCG distribution

Mathematics Subject Classification ID

Generalized linear models (logistic models) (62J12)

Cited In (6)

• A divide-and-conquer approach in applying EM for large recursive models with incomplete categorical data
• Surrogate maximization/minimization algorithms and extensions
• Discrete Bayesian network classifiers: a survey
• Discriminative vs. Generative Learning of Bayesian Network Classifiers
• Structural extension to logistic regression: Discriminative parameter learning of belief net classifiers
• Graphical chain models for the analysis of complex genetic diseases: an application to hypertension

This page was built for publication: The TM algorithm for maximising a conditional likelihood function.

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