Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Regularized Latent Class Analysis with Application in Cognitive Diagnosis

Regularized Latent Class Analysis with Application in Cognitive Diagnosis Diagnostic classification models are confirmatory in the sense that the relationship between the latent attributes and responses to items is specified or parameterized. Such models are readily interpretable with each component of the model usually having a practical meaning. However, parameterized diagnostic classification models are sometimes too simple to capture all the data patterns, resulting in significant model lack of fit. In this paper, we attempt to obtain a compromise between interpretability and goodness of fit by regularizing a latent class model. Our approach starts with minimal assumptions on the data structure, followed by suitable regularization to reduce complexity, so that readily interpretable, yet flexible model is obtained. An expectation–maximization-type algorithm is developed for efficient computation. It is shown that the proposed approach enjoys good theoretical properties. Results from simulation studies and a real application are presented. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Psychometrika Springer Journals

Regularized Latent Class Analysis with Application in Cognitive Diagnosis

Psychometrika , Volume 82 (3) – Nov 30, 2016

Loading next page...
 
/lp/springer_journal/regularized-latent-class-analysis-with-application-in-cognitive-p2LEMkN1iD

References (51)

Publisher
Springer Journals
Copyright
Copyright © 2016 by The Psychometric Society
Subject
Psychology; Psychometrics; Assessment, Testing and Evaluation; Statistics for Social Science, Behavorial Science, Education, Public Policy, and Law; Statistical Theory and Methods
ISSN
0033-3123
eISSN
1860-0980
DOI
10.1007/s11336-016-9545-6
Publisher site
See Article on Publisher Site

Abstract

Diagnostic classification models are confirmatory in the sense that the relationship between the latent attributes and responses to items is specified or parameterized. Such models are readily interpretable with each component of the model usually having a practical meaning. However, parameterized diagnostic classification models are sometimes too simple to capture all the data patterns, resulting in significant model lack of fit. In this paper, we attempt to obtain a compromise between interpretability and goodness of fit by regularizing a latent class model. Our approach starts with minimal assumptions on the data structure, followed by suitable regularization to reduce complexity, so that readily interpretable, yet flexible model is obtained. An expectation–maximization-type algorithm is developed for efficient computation. It is shown that the proposed approach enjoys good theoretical properties. Results from simulation studies and a real application are presented.

Journal

PsychometrikaSpringer Journals

Published: Nov 30, 2016

There are no references for this article.