Jonas Bjermo, Ellinor Fackle-Fornius, Frank Miller
Before items can be implemented in a test, the item characteristics need to be calibrated through pretesting. To achieve high-quality tests, it's crucial to maximize the precision of estimates obtained during item calibration. Higher precision can be attained if calibration items are allocated to examinees based on their individual abilities. Methods from optimal experimental design can be used to derive an optimal ability-matched calibration design. However, such an optimal design assumes known abilities of the examinees. In practice, the abilities are unknown and estimated based on a limited number of operational items. We develop the theory for handling the uncertainty in abilities in a proper way and show how the optimal calibration design can be derived when taking account of this uncertainty. We demonstrate that the derived designs are more robust when the uncertainty in abilities is acknowledged. Additionally, the method has been implemented in the R-package optical.
{"title":"Optimizing calibration designs with uncertainty in abilities","authors":"Jonas Bjermo, Ellinor Fackle-Fornius, Frank Miller","doi":"10.1111/bmsp.12387","DOIUrl":"10.1111/bmsp.12387","url":null,"abstract":"<p>Before items can be implemented in a test, the item characteristics need to be calibrated through pretesting. To achieve high-quality tests, it's crucial to maximize the precision of estimates obtained during item calibration. Higher precision can be attained if calibration items are allocated to examinees based on their individual abilities. Methods from optimal experimental design can be used to derive an optimal ability-matched calibration design. However, such an optimal design assumes known abilities of the examinees. In practice, the abilities are unknown and estimated based on a limited number of operational items. We develop the theory for handling the uncertainty in abilities in a proper way and show how the optimal calibration design can be derived when taking account of this uncertainty. We demonstrate that the derived designs are more robust when the uncertainty in abilities is acknowledged. Additionally, the method has been implemented in the R-package <span>optical</span>.</p>","PeriodicalId":55322,"journal":{"name":"British Journal of Mathematical & Statistical Psychology","volume":"78 3","pages":"889-910"},"PeriodicalIF":1.8,"publicationDate":"2025-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://bpspsychub.onlinelibrary.wiley.com/doi/epdf/10.1111/bmsp.12387","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143598524","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"心理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Integer programming (IP) is an extension of linear programming (LP) whereby the goal is to determine values for a set of decision variables (some or all of which have integer restrictions) so as to maximize or minimize a linear objective function of the variables subject to a set of linear constraints involving the variables. Although the psychological literature is replete with applications of multivariate statistics, implementations of mathematical modelling methods such as IP are comparatively far fewer. Nevertheless, over the decades, there have been a variety of important applications and the vast majority of these fall within the IP rather than the LP category. In this paper, we offer a brief overview of the history of IP methodology. We subsequently review some domains where IP has been gainfully applied in psychology, such as test assembly, cluster analysis and classification and seriation and unidimensional scaling. An illustrative example of using IP to cluster respondents measured on items pertaining to substance abuse disorder is provided. Finally, we identify areas where IP might be applied in emerging areas of psychology, such as in the domain of network psychometrics.
{"title":"Integer programming in psychology: A review and directions for future research","authors":"Michael Brusco, Douglas Steinley, Ashley L. Watts","doi":"10.1111/bmsp.12386","DOIUrl":"10.1111/bmsp.12386","url":null,"abstract":"<p>Integer programming (IP) is an extension of linear programming (LP) whereby the goal is to determine values for a set of decision variables (some or all of which have integer restrictions) so as to maximize or minimize a linear objective function of the variables subject to a set of linear constraints involving the variables. Although the psychological literature is replete with applications of multivariate statistics, implementations of mathematical modelling methods such as IP are comparatively far fewer. Nevertheless, over the decades, there have been a variety of important applications and the vast majority of these fall within the IP rather than the LP category. In this paper, we offer a brief overview of the history of IP methodology. We subsequently review some domains where IP has been gainfully applied in psychology, such as test assembly, cluster analysis and classification and seriation and unidimensional scaling. An illustrative example of using IP to cluster respondents measured on items pertaining to substance abuse disorder is provided. Finally, we identify areas where IP might be applied in emerging areas of psychology, such as in the domain of network psychometrics.</p>","PeriodicalId":55322,"journal":{"name":"British Journal of Mathematical & Statistical Psychology","volume":"79 1","pages":"1-30"},"PeriodicalIF":1.8,"publicationDate":"2025-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143517464","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"心理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Zichu Liu, Shiyu Wang, Houping Xiao, Shumei Zhang, Tao Qiu
Understanding students' learning trajectories is crucial for educators to effectively monitor and enhance progress. With the rise of computer-based testing, researchers now have access to rich datasets that provide deeper insights into student performance. This study introduces a general dynamic learning model framework that integrates response accuracy and response times to capture different test-taking behaviors and estimate learning trajectories related to polytomous attributes over time. A Bayesian estimation method is proposed to estimate model parameters. Rigorous validation through simulation studies confirms the effectiveness of the MCMC algorithm in parameter recovery and highlights the model's utility in understanding learning trajectories and detecting different test-taking behaviors in a learning environment. Applied to real data, the model demonstrates practical value in educational settings. Overall, this comprehensive and validated model offers educators and researchers nuanced insights into student learning progress and behavioral dynamics.
{"title":"A general dynamic learning model framework for cognitive diagnosis","authors":"Zichu Liu, Shiyu Wang, Houping Xiao, Shumei Zhang, Tao Qiu","doi":"10.1111/bmsp.12384","DOIUrl":"10.1111/bmsp.12384","url":null,"abstract":"<p>Understanding students' learning trajectories is crucial for educators to effectively monitor and enhance progress. With the rise of computer-based testing, researchers now have access to rich datasets that provide deeper insights into student performance. This study introduces a general dynamic learning model framework that integrates response accuracy and response times to capture different test-taking behaviors and estimate learning trajectories related to polytomous attributes over time. A Bayesian estimation method is proposed to estimate model parameters. Rigorous validation through simulation studies confirms the effectiveness of the MCMC algorithm in parameter recovery and highlights the model's utility in understanding learning trajectories and detecting different test-taking behaviors in a learning environment. Applied to real data, the model demonstrates practical value in educational settings. Overall, this comprehensive and validated model offers educators and researchers nuanced insights into student learning progress and behavioral dynamics.</p>","PeriodicalId":55322,"journal":{"name":"British Journal of Mathematical & Statistical Psychology","volume":"78 3","pages":"856-888"},"PeriodicalIF":1.8,"publicationDate":"2025-02-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://bpspsychub.onlinelibrary.wiley.com/doi/epdf/10.1111/bmsp.12384","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143477198","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"心理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
<p>Li, J., & Chen, P. (2024). A new Q-matrix validation method based on signal detection theory. <i>British Journal of Mathematical and Statistical Psychology</i>, 00, 1–33. https://doi.org/10.1111/bmsp.12371</p><p>In the third paragraph of “Search algorithm equipped with AIC” section, the text “… and the Stepwise method has a time complexity of <span></span><math>