Hostname: page-component-6766d58669-88psn Total loading time: 0 Render date: 2026-05-21T08:25:18.582Z Has data issue: false hasContentIssue false

The EM Algorithm for Latent Class Analysis with Equality Constraints

Published online by Cambridge University Press:  01 January 2025

AB Mooijaart*
Affiliation:
University of Leiden
Peter G. M. van der Heijden
Affiliation:
Department of Empirical and Theoretical Sociology, University of Utrecht
*
Requests for reprints should be sent to Ab Mooijaart, Department of Psychology, Leiden University, Wassenaarseweg 52, 2333 AK, Leiden, THE NETHERLANDS.

Abstract

The EM algorithm is a popular iterative method for estimating parameters in the latent class model where at each step the unknown parameters can be estimated simply as weighted sums of some latent proportions. The algorithm may also be used when some parameters are constrained to equal given constants or each other. It is shown that in the general case with equality constraints, the EM algorithm is not simple to apply because a nonlinear equation has to be solved. This problem arises, mainly, when equality constraints are defined over probabilities in different combinations of variables and latent classes. A simple condition is given in which, although probabilities in different variable-latent class combinations are constrained to be equal, the EM algorithm is still simple to apply.

Information

Type
Original Paper
Copyright
Copyright © 1992 The Psychometric Society

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable