Definition
A latent class model posits that observed discrete outcomes for subjects arise from membership in one of m unobserved (latent) classes. It is the discrete-latent-variable special case of the broader latent structure framework (Lazarsfeld 1950): manifest variables A,B,C,D are locally independent — conditionally independent given the latent class — so the marginal cell probabilities factorize as:
πijkl=v=1∑mπivAπjvBπkvCπlvDφv
where φv=P(class=v) and πivA=P(A=i∣class=v). The model has 5m−1 free parameters for the case of four binary manifest variables. When the latent distribution φ(θ) is continuous rather than discrete, the model becomes a latent structure model with continuous heterogeneity (e.g., the Rasch model or normal-mixture model).
Key Ideas
- Marginal likelihood: P(Yi)=∑l=0L−1P(Yi∣di=l)P(di=l), where di is the latent class indicator.
- Conditional independence (CI): P(Yi∣di)=∏jpj(di); identifiable with J ≥ 3 binary tests and two latent classes.
- Classical estimation: Lazarsfeld's accounting equations (moment-matching) and T.W. Anderson's (1954) determinantal method (matrix-algebraic, non-ML). The accounting equations for 4 binary variables yield 4 + 6 + 4 = 14 equations; 5m−1 parameters require at least this many.
- EM (Expectation-Maximization) algorithm (Goodman 1974; Dempster-Laird-Rubin 1977): treat latent class membership as missing data and augment the observed table with a class dimension. E-step computes posterior class memberships πijklv∗; M-step updates πivA and φv from expected marginals. See EM Algorithm.
- Model flexibility: constraining or equating parameters (Goodman scaling models, multi-latent-variable models) simply merges EM equations — no re-derivation needed.
- Latent profile analysis (Gibson 1959): the same accounting equations apply when manifest variables are continuous; within-class uncorrelatedness replaces conditional independence of discrete categories.
- Exploratory vs. confirmatory mode (Ernste-Fischer 1991): exploratory LCA fits unrestricted models (no a-priori constraints on the probabilities) and lets the data pick the number of classes; confirmatory LCA imposes size restrictions on the conditional and/or latent-class probabilities to test structural hypotheses, and supports multi-population comparison (Clogg-Goodman 1984/85). As a log-linear model with a composite link (Thompson-Baker 1981), the LC model is a special case of GLMs; the likelihood-ratio L2 is preferred over Pearson X2 for model selection because it is partitionable once the class count T is fixed. Used this way the model is a tool for typological analysis — e.g. a six-class typology of residents from five categorical demographic indicators.
- Unifying framework and three-step analysis (Vermunt 2022): a model is "latent class / mixture" whenever some parameters differ across unobserved subgroups; this one idea underlies four seemingly unrelated uses — clustering (simple LC), scaling (restricted LC, e.g. LC/Rasch scaling models), density estimation (mixtures approximating an unknown distribution), and nonparametric random-effects modeling (mixture regression / mixture growth models). Vermunt stresses the practical three-step workflow that dominates applied LCA: (1) fit the LC measurement model, (2) assign cases to classes, (3) relate class membership to external covariates — with a bias correction (Bolck-Croon-Hagenaars / Vermunt) because naive step-3 regression on modal-class assignments underestimates covariate effects by ignoring classification error. He also surveys recent extensions: latent Markov (hidden Markov) models for longitudinal class transitions, mixture growth models, mixed-scale indicators, and estimation/identification/model-selection practice (with software such as Latent GOLD).
- Model typology (Magidson-Vermunt 2004): one finite-mixture engine specializes into three applied models — (i) LC cluster (a single nominal latent variable → soft, model-based clustering); (ii) LC factor (several dichotomous latent variables, the discrete analogue of factor analysis, with biplot displays); (iii) LC regression / mixture regression (class-specific regression coefficients, with class membership itself allowed to depend on covariates via concomitant-variable models, Dayton-Macready 1988). The framework extends to mixed-scale indicators (nominal, ordinal, continuous, count).
- Concomitant latent class regression (Bandeen-Roche et al. 1997): the regression face of latent class analysis for a construct measured by multiple discrete indicators (e.g. disability from many activity-of-daily-living items). Class membership is a latent polytomous (multinomial) regression on covariates, πj(xi)=Pr[Si=j∣xi] via a link function, while the measurement part stays standard LC (local independence). The load-bearing assumption is nondifferential measurement — Pr[Yim∣Si,xi]=Pr[Yim∣Si], i.e. Yi⊥xi∣Si — which is exactly what makes Si a summary construct whose covariate effects are fully mediated through latent status (and whose failure is the local-dependence problem the BVR diagnostics target). Crucially the model marginalizes to a standard finite mixture, so class-count selection, EM fitting, standard errors, and identifiability carry over from ordinary LCA.
- Concomitant-variable LC model with EM (van der Heijden et al. 1996): the earlier, EM-based development of the same idea. Simultaneous LCA (Clogg-Goodman 1984) relates a categorical grouping variable to the latent classes; the concomitant-variable model generalizes this to continuous explanatory variables entering the class-membership probabilities, and the paper works out the EM estimation procedure in detail (E-step: posterior class memberships; M-step: a weighted multinomial-logit fit of class membership on the covariates plus the usual measurement update). Illustrated on juvenile delinquency — the constructive predecessor of the Bandeen-Roche latent-regression formulation.
- Bivariate residuals (BVR) (Magidson-Vermunt 2004): a local-dependence diagnostic that flags pairs of indicators whose two-way association the LC model fails to reproduce — often revealing inadequate pairwise fit even when the overall L2 looks acceptable — and motivates adding direct-effect terms. Applied to continuous data, LC clustering generalizes K-means by allowing unequal within-class variances and probabilistic assignment.
- Dependence structures: When conditional independence is violated, several alternatives exist:
- Beta-binomial (BB): ∑jYij∣di∼BB(αdi,βdi); models within-class exchangeable overdispersion.
- Gaussian random effects (GRE, Qu et al. 1996): (Yij∣di,bi)∼Bernoulli(Φ(βjdi+σdibi)); requires J ≥ 4 for identifiability. Adding a normal subject random effect bi absorbs residual within-class association into a continuous latent rather than proliferating discrete classes — implemented (with a further period-level random effect for longitudinal data) in the randomLCA R package (Beath 2017), fitted by marginal ML with adaptive Gauss-Hermite quadrature.
- Finite mixture (FM, Albert et al. 2001): proportion ηd of subjects in class d are always correctly classified; sensitivityj=η1+(1−η1)ωj(1).
- Multilevel LC models (Vermunt 2008): a distinct hierarchy axis — dependence among lower-level units nested in higher-level units (pupils in schools, patients in clinics) — handled by letting model parameters vary randomly across higher-level observations. Variants place the random effects on the LC-membership logit (group-level differences in class prevalence) or on the response model; the focal variant uses discrete random effects, clustering higher-level units by the likelihood of their members' class memberships, so the model has mixture distributions at two levels (group and subject). Fitted by an adapted EM algorithm (upward-downward recursion for the nested latent structure), it is the LC/finite-mixture analogue of a multilevel model.
Ordered class-assignment: enforcing the labels in estimation (Brown-Greene-Harris 2014)
In generalised LCMs the mixing probabilities are made covariate-dependent, and the near-universal choice is a multinomial-logit (MNL) class-assignment equation πq=exp(zi′γq)/∑kexp(zi′γk). Brown, Greene and Harris (2014) argue this is the model's weak point: it adds kz parameters per extra class, carries the unwanted Independence of Irrelevant Alternatives (IIA) property (odds of class 1 vs. 2 shouldn't depend on whether classes 3–5 exist), and — since the number of classes Q∗ is picked by an information criterion IC(Q)=−2ℓ^Q+λNpQ whose penalty grows in the parameter count pQ — biases the chosen Q∗ downward and often just fails to converge.
Their fix exploits a fact every applied user already relies on: classes are almost always ranked and labelled ex post by their class-specific expected values. Since EVq is monotone in the latent index xi′βq, imposing xi′β1≤⋯≤xi′βQ is necessary and sufficient for EV1≤⋯≤EVQ, enforced by the recursion EVi,q∗=EVi,q−1∗+exp(xi′βq) (each βq, q>1, then reads as a differential effect over the previous class). Paired with an ordered (probit/logit) class-assignment specification — one ordered index in place of Q−1 MNL vectors — this is far more parsimonious. On British Household Panel Survey BMI data the MNL LCM supported only 2 classes; the ordered formulation supported up to 5. The gain is real only when class membership depends on covariates and the outcome has a genuine ordinal/cardinal ordering; otherwise it is a one-to-one reparameterisation.
How It Works
Parameters are estimated by maximum likelihood (EM algorithm) or Bayesian Markov Chain Monte Carlo (MCMC). The EM algorithm treats latent class memberships as missing data and alternates between computing posterior class probabilities (E-step) and maximising the completed-data log-likelihood (M-step). Identifiability requires sufficient tests (J) and that the model is globally identified — not just locally.
Why It Matters
Latent class models are widely used in diagnostic accuracy studies where no gold standard exists (e.g., rating reliability studies, medical test evaluation). They allow estimation of sensitivity and specificity without a reference test by treating true disease status as a latent variable.
Open Questions
- Robustness to misspecification: Albert-Dodd (2004) demonstrate that misspecified maximum likelihood estimates (MLEs) converge to pseudo-true parameters that are nearly indistinguishable in likelihood yet yield sensitivity estimates differing by ~0.2. With J = 5 raters, correct model identification is essentially impossible.
- Identifiability with small J: The minimum J for identifiability varies by model; GRE requires J ≥ 4 and reliable discrimination between models requires J ≥ 10.
- Bayesian alternatives: Dendukuri-Joseph (2001) propose a Bayesian approach that incorporates prior information on sensitivity/specificity, which may help stabilise estimates under near-non-identifiability.
Related