The EM algorithm for graphical association models with missing data
Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt
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.
Originalsprog | Engelsk |
---|---|
Tidsskrift | Computational Statistics & Data Analysis |
Vol/bind | 19 |
Udgave nummer | 2 |
Sider (fra-til) | 191-201 |
Antal sider | 11 |
ISSN | 0167-9473 |
DOI | |
Status | Udgivet - 1995 |
Eksternt udgivet | Ja |
ID: 127873789