Andersen (1982) Latent Structure Analysis: A Survey

latent-classem-algorithmitem-response-theoryrasch-modellatent-variablemixture-modelcategorical-datapsychometricscontingency-tableidentifiabilityliterature-survey

Summary

Andersen surveys the latent structure analysis literature from Lazarsfeld's (1950) founding through early 1980s developments. The unifying framework: manifest variables are conditionally independent given a latent variable θ\theta, so cell probabilities factorize as πijkl=πiA(θ)πjB(θ)πkC(θ)πlD(θ)φ(θ)dθ\pi_{ijkl} = \int \pi_i^A(\theta)\pi_j^B(\theta)\pi_k^C(\theta)\pi_l^D(\theta)\varphi(\theta)d\theta. The paper covers the discrete case (latent class model, expectation-maximization (EM) algorithm), the continuous case with parametric item characteristic curves (Rasch/Birnbaum-Lord models), latent profile analysis for continuous variables, multi-population comparison models, longitudinal models with correlated latent variables, and latent factor analysis.

Key Claims

Concepts Introduced or Extended

Entities Mentioned

Quotes

"The difference between [the conditional model given θ\theta and the marginal model] is crucial in the understanding of latent structure models."

"No satisfactory numerical method is available at present for dealing with the likelihood equations [involving double integrals for the longitudinal latent variable model]."

My Take

A clean pedagogical survey that earns its place as the reference entry point for latent structure analysis. The principal contributions for this wiki are: (1) the canonical local-independence model unifying the entire family; (2) the EM algorithm derivation for latent class as an exponential family missing-data problem (predating or parallel to Dempster-Laird-Rubin 1977 per Goodman 1974); (3) the Rasch model sufficiency result and marginal ML formulation. The longitudinal section (Section 9) is more programmatic than substantive. The latent factor analysis section is dense. From a modern perspective, the paper's most lasting contribution is showing how the EM algorithm transforms the estimation of all latent structure models — a theme that runs through mixture-of-normals, hidden Markov model (HMM), and hierarchical Bayes methods that the wiki covers extensively elsewhere.