TL;DR
This paper introduces a post-estimation refinement method for Latent Class Analysis that produces sparse, interpretable item response probability matrices, validated through theory, simulations, and real data application.
Contribution
It proposes a novel, computationally efficient procedure to enhance LCA interpretability by inducing sparsity in response probabilities, improving clarity over classical methods.
Findings
The method consistently recovers sparse response patterns asymptotically.
Simulations demonstrate improved interpretability without sacrificing accuracy.
Application to survey data yields clearer latent class characterization.
Abstract
Latent Class Analysis (LCA) is widely used to identify unobserved subgroups in social and behavioural sciences. A long-standing challenge for LCA is the interpretability of the latent classes, due to the high complexity of the estimated item response probability matrix. To address this, we propose a computationally efficient post-estimation refinement procedure that enhances model interpretability by a sparse model estimate. The method begins by estimating a classical, unrestricted, latent class model and determining the number of classes using the Bayesian information criterion (BIC). It is followed by a refinement step that further performs model selection on the item-specific response probabilities based on the initial estimate. This refinement penalises the number of distinct response probability levels per item, collapsing redundant levels to yield a sparse matrix that is…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
