Transcription of Maximum Likelihood from Incomplete Data via the EM ...
{{id}} {{{paragraph}}}
Maximum Likelihood from Incomplete data via the EM AlgorithmA. P. Dempster; N. M. Laird; D. B. RubinJournal of the Royal Statistical Society. Series B (Methodological), Vol. 39, No. 1. (1977), URL: of the Royal Statistical Society. Series B (Methodological)is currently published by Royal Statistical use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtainedprior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content inthe JSTOR archive only for your personal, non-commercial contact the publisher regarding any further use of this work.
the associated theory, and in part because of the wide range of examples which fall under its umbrella. When the underlying complete data come from an exponential family whose maximum-likelihood estimates are easily computed, then each maximization step of an EM algorithm is likewise easily computed.
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
{{id}} {{{paragraph}}}