Finite Mixture Distribution, Sequential Likelihood, and the EM Algorithm
The use of finite mixture distributions to control for unobserved heterogeneity has become increasingly popular among those estimating dynamic discrete choice models. One of the barriers to using mixture models is that parameters that could previously be estimated in stages must now be estimated jointly: using mixture distributions destroys any additive separability of the log likelihood function. The EM algorithm reintroduces additive separability, however, thus allowing the option of estimating parameters sequentially during each maximization step. We show that, relative to full information maximum likelihood, the EM algorithm with sequential maximization (ESM) can generate large computational savings with little loss of efficiency.
|Date of creation:||2000|
|Date of revision:|
|Contact details of provider:|| Postal: Department of Economics Duke University 213 Social Sciences Building Box 90097 Durham, NC 27708-0097|
Phone: (919) 660-1800
Fax: (919) 684-8974
Web page: http://econ.duke.edu/
When requesting a correction, please mention this item's handle: RePEc:duk:dukeec:00-16. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Department of Economics Webmaster)
If references are entirely missing, you can add them using this form.