Correction to “A new Q-matrix validation method based on signal detection theory”

Abstract

Li, J., & Chen, P. (2024). A new Q-matrix validation method based on signal detection theory. British Journal of Mathematical and Statistical Psychology, 00, 1–33. https://doi.org/10.1111/bmsp.12371

In the third paragraph of “Search algorithm equipped with AIC” section, the text “… and the Stepwise method has a time complexity of $O\left(K·\left(K-1\right)\right)$. It is clear that $O\left(2^{K-2}+1+K\right)<O\left(K·\left(K-1\right)\right)<O\left(2^K-1\right)$ when $K>3$. Therefore, the new search algorithm is not only effective but also efficient” was incorrect. This should have read “… and the time complexity of the Stepwise method is between $O\left(K·\left(K-1\right)+K\right)$ and $O\left(K·2^{K-1}\right)$ given $K\ge 3$. It is clear that $O\left(2^{K-2}+1+K\right)<O\left(2^K-1\right)$ when $K\ge 3$ and $O\left(2^{K-2}+1+K\right)<O\left(K·\left(K-1\right)+K\right)$ when $3\le K\le 7$ (note that $O\left(2^{K-2}+1+K\right)<O\left(K·2^{K-1}\right)\text{when}K\ge 3$). Therefore, the new search algorithm is not only effective, but also efficient in some cases.”

We apologize for this error.