Xu Gongjun, Wang Chun, Shang Zhuoran
School of Statistics, University of Minnesota, Minneapolis, Minnesota, USA.
Department of Psychology, University of Minnesota, Minneapolis, Minnesota, USA.
Br J Math Stat Psychol. 2016 Nov;69(3):291-315. doi: 10.1111/bmsp.12072.
There has recently been much interest in computerized adaptive testing (CAT) for cognitive diagnosis. While there exist various item selection criteria and different asymptotically optimal designs, these are mostly constructed based on the asymptotic theory assuming the test length goes to infinity. In practice, with limited test lengths, the desired asymptotic optimality may not always apply, and there are few studies in the literature concerning the optimal design of finite items. Related questions, such as how many items we need in order to be able to identify the attribute pattern of an examinee and what types of initial items provide the optimal classification results, are still open. This paper aims to answer these questions by providing non-asymptotic theory of the optimal selection of initial items in cognitive diagnostic CAT. In particular, for the optimal design, we provide necessary and sufficient conditions for the Q-matrix structure of the initial items. The theoretical development is suitable for a general family of cognitive diagnostic models. The results not only provide a guideline for the design of optimal item selection procedures, but also may be applied to guide item bank construction.
最近,计算机自适应测试(CAT)在认知诊断方面备受关注。虽然存在各种项目选择标准和不同的渐近最优设计,但这些大多是基于渐近理论构建的,假设测试长度趋于无穷大。在实际应用中,由于测试长度有限,期望的渐近最优性可能并不总是适用,并且文献中很少有关于有限项目最优设计的研究。相关问题,例如为了能够识别考生的属性模式我们需要多少个项目,以及哪种类型的初始项目能提供最优分类结果,仍然没有答案。本文旨在通过提供认知诊断CAT中初始项目最优选择的非渐近理论来回答这些问题。特别是,对于最优设计,我们给出了初始项目Q矩阵结构的充要条件。理论发展适用于一般的认知诊断模型族。这些结果不仅为最优项目选择程序的设计提供了指导方针,还可用于指导题库建设。