File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1007/s11336-022-09867-5
- Scopus: eid_2-s2.0-85130299652
- PMID: 35596101
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Learning Latent and Hierarchical Structures in Cognitive Diagnosis Models
Title | Learning Latent and Hierarchical Structures in Cognitive Diagnosis Models |
---|---|
Authors | |
Keywords | cognitive diagnosis model hierarchical structure penalized EM algorithm Q-matrix |
Issue Date | 2023 |
Citation | Psychometrika, 2023, v. 88, n. 1, p. 175-207 How to Cite? |
Abstract | Cognitive Diagnosis Models (CDMs) are a special family of discrete latent variable models that are widely used in educational and psychological measurement. A key component of CDMs is the Q-matrix characterizing the dependence structure between the items and the latent attributes. Additionally, researchers also assume in many applications certain hierarchical structures among the latent attributes to characterize their dependence. In most CDM applications, the attribute–attribute hierarchical structures, the item-attribute Q-matrix, the item-level diagnostic models, as well as the number of latent attributes, need to be fully or partially pre-specified, which however may be subjective and misspecified as noted by many recent studies. This paper considers the problem of jointly learning these latent and hierarchical structures in CDMs from observed data with minimal model assumptions. Specifically, a penalized likelihood approach is proposed to select the number of attributes and estimate the latent and hierarchical structures simultaneously. An expectation-maximization (EM) algorithm is developed for efficient computation, and statistical consistency theory is also established under mild conditions. The good performance of the proposed method is illustrated by simulation studies and real data applications in educational assessment. |
Persistent Identifier | http://hdl.handle.net/10722/344442 |
ISSN | 2023 Impact Factor: 2.9 2023 SCImago Journal Rankings: 2.376 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ma, Chenchen | - |
dc.contributor.author | Ouyang, Jing | - |
dc.contributor.author | Xu, Gongjun | - |
dc.date.accessioned | 2024-07-31T03:03:32Z | - |
dc.date.available | 2024-07-31T03:03:32Z | - |
dc.date.issued | 2023 | - |
dc.identifier.citation | Psychometrika, 2023, v. 88, n. 1, p. 175-207 | - |
dc.identifier.issn | 0033-3123 | - |
dc.identifier.uri | http://hdl.handle.net/10722/344442 | - |
dc.description.abstract | Cognitive Diagnosis Models (CDMs) are a special family of discrete latent variable models that are widely used in educational and psychological measurement. A key component of CDMs is the Q-matrix characterizing the dependence structure between the items and the latent attributes. Additionally, researchers also assume in many applications certain hierarchical structures among the latent attributes to characterize their dependence. In most CDM applications, the attribute–attribute hierarchical structures, the item-attribute Q-matrix, the item-level diagnostic models, as well as the number of latent attributes, need to be fully or partially pre-specified, which however may be subjective and misspecified as noted by many recent studies. This paper considers the problem of jointly learning these latent and hierarchical structures in CDMs from observed data with minimal model assumptions. Specifically, a penalized likelihood approach is proposed to select the number of attributes and estimate the latent and hierarchical structures simultaneously. An expectation-maximization (EM) algorithm is developed for efficient computation, and statistical consistency theory is also established under mild conditions. The good performance of the proposed method is illustrated by simulation studies and real data applications in educational assessment. | - |
dc.language | eng | - |
dc.relation.ispartof | Psychometrika | - |
dc.subject | cognitive diagnosis model | - |
dc.subject | hierarchical structure | - |
dc.subject | penalized EM algorithm | - |
dc.subject | Q-matrix | - |
dc.title | Learning Latent and Hierarchical Structures in Cognitive Diagnosis Models | - |
dc.type | Article | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1007/s11336-022-09867-5 | - |
dc.identifier.pmid | 35596101 | - |
dc.identifier.scopus | eid_2-s2.0-85130299652 | - |
dc.identifier.volume | 88 | - |
dc.identifier.issue | 1 | - |
dc.identifier.spage | 175 | - |
dc.identifier.epage | 207 | - |
dc.identifier.eissn | 1860-0980 | - |