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

IF 1.5 3区心理学 Q3 MATHEMATICS, INTERDISCIPLINARY APPLICATIONS

British Journal of Mathematical & Statistical Psychology Pub Date : 2025-02-21 DOI:10.1111/bmsp.12385

{"title":"Correction to “A new Q-matrix validation method based on signal detection theory”","authors":"","doi":"10.1111/bmsp.12385","DOIUrl":null,"url":null,"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.12371In the third paragraph of “Search algorithm equipped with AIC” section, the text “… and the Stepwise method has a time complexity of <math>\n <mi>O</mi>\n <mfenced>\n <mrow>\n <mi>K</mi>\n <mo>·</mo>\n <mfenced>\n <mrow>\n <mi>K</mi>\n <mo>−</mo>\n <mn>1</mn>\n </mrow>\n </mfenced>\n </mrow>\n </mfenced></math>. It is clear that <math>\n <mi>O</mi>\n <mfenced>\n <mrow>\n <msup>\n <mn>2</mn>\n <mrow>\n <mi>K</mi>\n <mo>−</mo>\n <mn>2</mn>\n </mrow>\n </msup>\n <mo>+</mo>\n <mn>1</mn>\n <mo>+</mo>\n <mi>K</mi>\n </mrow>\n </mfenced>\n <mo><</mo>\n <mi>O</mi>\n <mfenced>\n <mrow>\n <mi>K</mi>\n <mo>·</mo>\n <mfenced>\n <mrow>\n <mi>K</mi>\n <mo>−</mo>\n <mn>1</mn>\n </mrow>\n </mfenced>\n </mrow>\n </mfenced>\n <mo><</mo>\n <mi>O</mi>\n <mfenced>\n <mrow>\n <msup>\n <mn>2</mn>\n <mi>K</mi>\n </msup>\n <mo>−</mo>\n <mn>1</mn>\n </mrow>\n </mfenced></math> when <math>\n <mi>K</mi>\n <mo>></mo>\n <mn>3</mn></math>. 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 <math>\n <mi>O</mi>\n <mfenced>\n <mrow>\n <mi>K</mi>\n <mo>·</mo>\n <mfenced>\n <mrow>\n <mi>K</mi>\n <mo>−</mo>\n <mn>1</mn>\n </mrow>\n </mfenced>\n <mo>+</mo>\n <mi>K</mi>\n </mrow>\n </mfenced></math> and <math>\n <mi>O</mi>\n <mfenced>\n <mrow>\n <mi>K</mi>\n <mo>·</mo>\n <msup>\n <mn>2</mn>\n <mrow>\n <mi>K</mi>\n <mo>−</mo>\n <mn>1</mn>\n </mrow>\n </msup>\n </mrow>\n </mfenced></math> given <math>\n <mi>K</mi>\n <mo>≥</mo>\n <mn>3</mn></math>. It is clear that <math>\n <mi>O</mi>\n <mfenced>\n <mrow>\n <msup>\n <mn>2</mn>\n <mrow>\n <mi>K</mi>\n <mo>−</mo>\n <mn>2</mn>\n </mrow>\n </msup>\n <mo>+</mo>\n <mn>1</mn>\n <mo>+</mo>\n <mi>K</mi>\n </mrow>\n </mfenced>\n <mo><</mo>\n <mi>O</mi>\n <mfenced>\n <mrow>\n <msup>\n <mn>2</mn>\n <mi>K</mi>\n </msup>\n <mo>−</mo>\n <mn>1</mn>\n </mrow>\n </mfenced></math> when <math>\n <mi>K</mi>\n <mo>≥</mo>\n <mn>3</mn></math> and <math>\n <mi>O</mi>\n <mfenced>\n <mrow>\n <msup>\n <mn>2</mn>\n <mrow>\n <mi>K</mi>\n <mo>−</mo>\n <mn>2</mn>\n </mrow>\n </msup>\n <mo>+</mo>\n <mn>1</mn>\n <mo>+</mo>\n <mi>K</mi>\n </mrow>\n </mfenced>\n <mo><</mo>\n <mi>O</mi>\n <mfenced>\n <mrow>\n <mi>K</mi>\n <mo>·</mo>\n <mfenced>\n <mrow>\n <mi>K</mi>\n <mo>−</mo>\n <mn>1</mn>\n </mrow>\n </mfenced>\n <mo>+</mo>\n <mi>K</mi>\n </mrow>\n </mfenced></math> when <math>\n <mn>3</mn>\n <mo>≤</mo>\n <mi>K</mi>\n <mo>≤</mo>\n <mn>7</mn></math> (note that <math>\n <mi>O</mi>\n <mfenced>\n <mrow>\n <msup>\n <mn>2</mn>\n <mrow>\n <mi>K</mi>\n <mo>−</mo>\n <mn>2</mn>\n </mrow>\n </msup>\n <mo>+</mo>\n <mn>1</mn>\n <mo>+</mo>\n <mi>K</mi>\n </mrow>\n </mfenced>\n <mo><</mo>\n <mi>O</mi>\n <mfenced>\n <mrow>\n <mi>K</mi>\n <mo>·</mo>\n <msup>\n <mn>2</mn>\n <mrow>\n <mi>K</mi>\n <mo>−</mo>\n <mn>1</mn>\n </mrow>\n </msup>\n </mrow>\n </mfenced>\n <mspace></mspace>\n <mtext>when</mtext>\n <mspace></mspace>\n <mi>K</mi>\n <mo>≥</mo>\n <mn>3</mn></math>). Therefore, the new search algorithm is not only effective, but also efficient in some cases.”We apologize for this error.","PeriodicalId":55322,"journal":{"name":"British Journal of Mathematical & Statistical Psychology","volume":"78 2","pages":"710"},"PeriodicalIF":1.5000,"publicationDate":"2025-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1111/bmsp.12385","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"British Journal of Mathematical & Statistical Psychology","FirstCategoryId":"102","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1111/bmsp.12385","RegionNum":3,"RegionCategory":"心理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}

引用次数: 0

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 (K \cdot (K - 1))$ . It is clear that $O (2^{K - 2} + 1 + K) < O (K \cdot (K - 1)) < O (2^{K} - 1)$ 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 (K \cdot (K - 1) + K)$ and $O (K \cdot 2^{K - 1})$ given $K \geq 3$ . It is clear that $O (2^{K - 2} + 1 + K) < O (2^{K} - 1)$ when $K \geq 3$ and $O (2^{K - 2} + 1 + K) < O (K \cdot (K - 1) + K)$ when $3 \leq K \leq 7$ (note that $O (2^{K - 2} + 1 + K) < O (K \cdot 2^{K - 1}) when K \geq 3$ ). Therefore, the new search algorithm is not only effective, but also efficient in some cases.”

We apologize for this error.

查看原文本刊更多论文

修正“一种新的基于信号检测理论的q矩阵验证方法”。

李，J, &；陈P.（2024）。基于信号检测理论的q矩阵验证新方法。心理科学学报，2009,33 - 33。https://doi.org/10.1111/bmsp.12371In“配备AIC的搜索算法”一节的第三段，文本“…”和Stepwise方法的时间复杂度为O K·K−1。很明显，o2k−2 + 1 + K <；O K·K−1 <；当K >；3. 因此，新的搜索算法“既有效又高效”的说法是不正确的。这应该是“…”，逐步方法的时间复杂度介于O K·K−1 + K和O之间当K≥3时，K·2 K−1。很明显，o2k−2 + 1 + K <；当K≥3时o2k−1，o2k−2+ 1 + K <；当3≤K≤7时，O K·K−1 + K(注意O2 K−2 + 1 + K <；当K≥3时，K·2 K−1)。因此，新的搜索算法不仅有效，但在某些情况下也很有效。”我们为这个错误道歉。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

British Journal of Mathematical & Statistical Psychology 医学-数学跨学科应用

CiteScore

5.00

自引率

3.80%

发文量

审稿时长

>12 weeks

期刊介绍： The British Journal of Mathematical and Statistical Psychology publishes articles relating to areas of psychology which have a greater mathematical or statistical aspect of their argument than is usually acceptable to other journals including: • mathematical psychology • statistics • psychometrics • decision making • psychophysics • classification • relevant areas of mathematics, computing and computer software These include articles that address substantitive psychological issues or that develop and extend techniques useful to psychologists. New models for psychological processes, new approaches to existing data, critiques of existing models and improved algorithms for estimating the parameters of a model are examples of articles which may be favoured.