# Learning Large Q-matrix by Restricted Boltzmann Machines

arXiv: https://arxiv.org/abs/2006.15424 · HTML: https://mlsanity.com/paper/2006.15424/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 27 Jun 2020.

## Built on by (most cited first, 1 of 1)

- [Learning Latent and Hierarchical Structures in Cognitive Diagnosis Models](https://mlsanity.com/paper/2104.02143/) (2021)

## Abstract (arXiv)

Estimation of the large Q-matrix in Cognitive Diagnosis Models (CDMs) with many items and latent attributes from observational data has been a huge challenge due to its high computational cost. Borrowing ideas from deep learning literature, we propose to learn the large Q-matrix by Restricted Boltzmann Machines (RBMs) to overcome the computational difficulties. In this paper, key relationships between RBMs and CDMs are identified. Consistent and robust learning of the Q-matrix in various CDMs is shown to be valid under certain conditions. Our simulation studies under different CDM settings show that RBMs not only outperform the existing methods in terms of learning speed, but also maintain good recovery accuracy of the Q-matrix. In the end, we illustrate the applicability and effectiveness of our method through a real data analysis on the Cattell's 16 personality test data set.