Latent Class Model

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: $$\pi_{ijkl} = \sum_{v=1}^m \pi_{iv}^A\pi_{jv}^B\pi_{kv}^C\pi_{lv}^D\varphi_v$$ where $\varphi_v = P(\text{class}=v)$ and $\pi_{iv}^A = P(A=i|\text{class}=v)$. The model has $5m-1$ free parameters for the case of four binary manifest variables. When the latent distribution $\varphi(\theta)$ 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(Y_i) = \sum_{l=0}^{L-1} P(Y_i \mid d_i = l) P(d_i = l)$, where $d_i$ is the latent class indicator.
• Conditional independence (CI): $P(Y_i \mid d_i) = \prod_j p_j(d_i)$; 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 $\pi^*_{ijklv}$; M-step updates $\pi_{iv}^A$ and $\varphi_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.
• Dependence structures: When conditional independence is violated, several alternatives exist:
  • Beta-binomial (BB): $\sum_j Y_{ij} \mid d_i \sim \text{BB}(\alpha_{d_i}, \beta_{d_i})$; models within-class exchangeable overdispersion.
  • Gaussian random effects (GRE, Qu et al. 1996): $(Y_{ij} \mid d_i, b_i) \sim \text{Bernoulli}(\Phi(\beta_{jd_i} + \sigma_{d_i} b_i))$; requires J ≥ 4 for identifiability.
  • Finite mixture (FM, Albert et al. 2001): proportion $\eta_d$ of subjects in class $d$ are always correctly classified; sensitivity$_j = \eta_1 + (1-\eta_1)\omega_j(1)$.

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

• EM Algorithm
• Mixture Model
• Rasch Model
• Erling B. Andersen
• Leo A. Goodman
• Paul S. Albert
• Lori E. Dodd
• Andersen (1982) Latent Structure Analysis: A Survey
• Goodman (1974) Exploratory Latent Structure Analysis
• Goodman (2002) Latent Class Analysis
• Albert-Dodd (2004)