Matrix Decomposition Perspective for Accuracy Assessment of Item Response Theory

03/07/2022
by   Hideo Hirose, et al.
4

The item response theory obtains the estimates and their confidence intervals for parameters of abilities of examinees and difficulties of problems by using the observed item response matrix consisting of 0/1 value elements. Many papers discuss the performance of the estimates. However, this paper does not. Using the maximum likelihood estimates, we can reconstruct the estimated item response matrix. Then we can assess the accuracy of this reconstructed matrix to the observed response matrix from the matrix decomposition perspective. That is, this paper focuses on the performance of the reconstructed response matrix. To compare the performance of the item response theory with others, we provided the two kinds of low rank response matrix by approximating the observed response matrix; one is the matrix via the singular value decomposition method when the response matrix is a complete matrix, and the other is the matrix via the matrix decomposition method when the response matrix is an incomplete matrix. We have, firstly, found that the performance of the singular value decomposition method and the matrix decomposition method is almost the same when the response matrix is a complete matrix. Here, the performance is measured by the closeness between the two matrices using the root mean squared errors and the accuracy. Secondary, we have seen that the closeness of the reconstructed matrix obtained from the item response theory to the observed matrix is located between the two approximated low rank response matrices obtained from the matrix decomposition method of k= and k=2 to the observed matrix, where k indicates the first k columns use in the decomposed matrices.

READ FULL TEXT

page 3

page 7

page 9

page 10

page 11

research
04/05/2022

RSVD-CUR Decomposition for Matrix Triplets

We propose a restricted SVD based CUR (RSVD-CUR) decomposition for matri...
research
06/07/2017

Fast Eigen Decomposition for Low-Rank Matrix Approximation

In this paper we present an efficient algorithm to compute the eigen dec...
research
07/19/2019

A Note on Exploratory Item Factor Analysis by Singular Value Decomposition

In this note, we revisit a singular value decomposition (SVD) based algo...
research
02/19/2021

A Higher-Order Generalized Singular Value Decomposition for Rank Deficient Matrices

The higher-order generalized singular value decomposition (HO-GSVD) is a...
research
05/24/2018

Confidence region of singular vectors for high-dimensional and low-rank matrix regression

Let M∈R^m_1× m_2 be an unknown matrix with r= rank( M)≪(m_1,m_2) whose ...
research
03/15/2019

A response-matrix-centred approach to presenting cross-section measurements

The current canonical approach to publishing cross-section data is to un...
research
09/23/2016

A penalized likelihood method for classification with matrix-valued predictors

We propose a penalized likelihood method to fit the linear discriminant ...

Please sign up or login with your details

Forgot password? Click here to reset