The EM algorithm for graphical association models with missing data

Steffen L. Lauritzen

doi:10.1016/0167-9473(93)E0056-A

The EM algorithm for graphical association models with missing data

474 Citations (Scopus)

Abstract

It is shown how the computational scheme of Lauritzen and Spiegelhalter (1988) can be exploited to perform the E-step of the EM algorithm when applied to finding maximum likelihood estimates or penalized maximum likelihood estimates in hierarchical log-linear models and recursive models for contingency tables with missing data. The generalization to mixed association models introduced in Lauritzen and Wermuth (1989) and Edwards (1990) is indicated.

Original language	English
Journal	Computational Statistics & Data Analysis
Volume	19
Issue number	2
Pages (from-to)	191-201
Number of pages	11
ISSN	0167-9473
DOIs	https://doi.org/10.1016/0167-9473(93)E0056-A
Publication status	Published - 1995
Externally published	Yes

Access to Document

10.1016/0167-9473(93)E0056-A

Cite this

@article{d659bee7069f485c84c284ea1521fa9a,

title = "The EM algorithm for graphical association models with missing data",

abstract = "It is shown how the computational scheme of Lauritzen and Spiegelhalter (1988) can be exploited to perform the E-step of the EM algorithm when applied to finding maximum likelihood estimates or penalized maximum likelihood estimates in hierarchical log-linear models and recursive models for contingency tables with missing data. The generalization to mixed association models introduced in Lauritzen and Wermuth (1989) and Edwards (1990) is indicated.",

author = "Lauritzen, {Steffen L.}",

year = "1995",

doi = "10.1016/0167-9473(93)E0056-A",

language = "English",

volume = "19",

pages = "191--201",

journal = "Computational Statistics & Data Analysis",

issn = "0167-9473",

publisher = "Elsevier",

number = "2",

}

TY - JOUR

T1 - The EM algorithm for graphical association models with missing data

AU - Lauritzen, Steffen L.

PY - 1995

Y1 - 1995

N2 - It is shown how the computational scheme of Lauritzen and Spiegelhalter (1988) can be exploited to perform the E-step of the EM algorithm when applied to finding maximum likelihood estimates or penalized maximum likelihood estimates in hierarchical log-linear models and recursive models for contingency tables with missing data. The generalization to mixed association models introduced in Lauritzen and Wermuth (1989) and Edwards (1990) is indicated.

AB - It is shown how the computational scheme of Lauritzen and Spiegelhalter (1988) can be exploited to perform the E-step of the EM algorithm when applied to finding maximum likelihood estimates or penalized maximum likelihood estimates in hierarchical log-linear models and recursive models for contingency tables with missing data. The generalization to mixed association models introduced in Lauritzen and Wermuth (1989) and Edwards (1990) is indicated.

U2 - 10.1016/0167-9473(93)E0056-A

DO - 10.1016/0167-9473(93)E0056-A

M3 - Journal article

SN - 0167-9473

VL - 19

SP - 191

EP - 201

JO - Computational Statistics & Data Analysis

JF - Computational Statistics & Data Analysis

IS - 2

ER -