Evidence map›Paper›PMID 36797538›Full record

ArticlePsychometrika2023

Identifiability of Hidden Markov Models for Learning Trajectories in Cognitive Diagnosis.

Ying Liu, Steven Andrew Culpepper, Yuguo Chen

Abstract read
PubMed Publisher
In one paragraph

Article in Psychometrika, 2023. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 3 papers.

0numbers the graph read from it
0cells of the map it votes in
3citing papers in PubMed
1.9field-weighted citation impact, top 12% of its field
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

3 citing papers in PubMed, 13 citations in OpenAlex.

  1. Article
  2. Article
  3. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

3 authors at 1 institution in 1 country.

Ying LiuDepartment of Statistics, University of Illinois at Urbana-Champaign, Computing Applications Building, Room 152, 605 E. Springfield Ave., Champaign, IL, 61820, USA.
Steven Andrew CulpepperDepartment of Statistics, University of Illinois at Urbana-Champaign, Computing Applications Building, Room 152, 605 E. Springfield Ave., Champaign, IL, 61820, USA. sculpepp@illinois.edu.ORCID http://orcid.org/0000-0003-4226-6176
Yuguo ChenDepartment of Statistics, University of Illinois at Urbana-Champaign, Computing Applications Building, Room 152, 605 E. Springfield Ave., Champaign, IL, 61820, USA.ORCID http://orcid.org/0000-0001-7148-1823
University of Illinois Urbana-Champaign · US

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Hidden Markov models (HMMs) have been applied in various domains, which makes the identifiability issue of HMMs popular among researchers. Classical identifiability conditions shown in previous studies are too strong for practical analysis. In this paper, we propose generic identifiability conditions for discrete time HMMs with finite state space. Also, recent studies about cognitive diagnosis models (CDMs) applied first-order HMMs to track changes in attributes related to learning. However, the application of CDMs requires a known [Formula: see text] matrix to infer the underlying structure between latent attributes and items, and the identifiability constraints of the model parameters should also be specified. We propose generic identifiability constraints for our restricted HMM and then estimate the model parameters, including the [Formula: see text] matrix, through a Bayesian framework. We present Monte Carlo simulation results to support our conclusion and apply the developed model to a real dataset.

Indexed as

CognitionBayes TheoremComputer SimulationMarkov ChainsMonte Carlo MethodPsychometricscognitive diagnosis modelDINA modelgeneric identifiabilityhidden Markov model

Identifiers

PMID36797538
OpenAlexW4321018292

What OpenQuestion holds

Textmetadata
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.