Mathematical, Statistical and Computing Psychology - RSS Feed
http://psychsource.bps.org.uk
Mathematical, Statistical and Computing Psychology - RSS Feedhttp://psychsource.bps.org.ukA note on computing Louis’ observed information matrix identity for IRT and cognitive diagnostic models
http://psychsource.bps.org.uk/details/journalArticle/11257531/A-note-on-computing-Louis-observed-information-matrix-identity-for-IRT-and-cogni.html
Using Louis’ formula, it is possible to obtain the observed information matrix and the corresponding large‐sample standard error estimates after the expectation–maximization (EM) algorithm has converged. However, Louis’ formula is commonly de‐emphasized due to its relatively complex integration representation, particularly when studying latent variable models. This paper provides a holistic overview that demonstrates how Louis’ formula can be applied efficiently to item response theory (IRT)...]]>2020-08-05T17:59:22ZThe problem of measurement bias in comparing selected subgroups
http://psychsource.bps.org.uk/details/journalArticle/11256668/The-problem-of-measurement-bias-in-comparing-selected-subgroups.html
Estimates of subgroup differences are routinely used as part of a comprehensive validation system, and these estimates serve a critical role, including evaluating adverse impact. Unfortunately, under direct range restriction, a selected mean ( ) is a biased estimator of the population mean as well as the selected true score mean . This is due partly to measurement bias. This bias, as we show, is a factor of the selection ratio, the reliability of the measure, and the variance of the...]]>2020-07-30T11:26:29ZRiemannian Newton and trust‐region algorithms for analytic rotation in exploratory factor analysis
http://psychsource.bps.org.uk/details/journalArticle/11255746/Riemannian-Newton-and-trustregion-algorithms-for-analytic-rotation-in-explorator.html
In exploratory factor analysis, latent factors and factor loadings are seldom interpretable until analytic rotation is performed. Typically, the rotation problem is solved by numerically searching for an element in the manifold of orthogonal or oblique rotation matrices such that the rotated factor loadings minimize a pre‐specified complexity function. The widely used gradient projection (GP) algorithm, although simple to program and able to deal with both orthogonal and oblique rotation, is...]]>2020-07-27T05:36:25ZNested diagnostic classification models for multiple‐choice items
http://psychsource.bps.org.uk/details/journalArticle/11255090/Nested-diagnostic-classification-models-for-multiplechoice-items.html
This study proposes and evaluates a diagnostic classification model framework for multiple‐choice items. Models in the proposed framework have a two‐level nested structure which allows for binary scoring (for correctness) and polytomous scoring (for distractors) at the same time. One advantage of these models is that they can provide distractor information while maintaining the statistical properties of the correct response option. We evaluated parameter recovery through a simulation study...]]>2020-07-23T07:24:19ZBayesian Gaussian distributional regression models for more efficient norm estimation
http://psychsource.bps.org.uk/details/journalArticle/11254505/Bayesian-Gaussian-distributional-regression-models-for-more-efficient-norm-estim.html
A test score on a psychological test is usually expressed as a normed score, representing its position relative to test scores in a reference population. These typically depend on predictor(s) such as age. The test score distribution conditional on predictors is estimated using regression, which may need large normative samples to estimate the relationships between the predictor(s) and the distribution characteristics properly. In this study, we examine to what extent this burden can be...]]>2020-07-21T06:56:11ZAn exploratory analysis of the latent structure of process data via action sequence autoencoders
http://psychsource.bps.org.uk/details/journalArticle/11242183/An-exploratory-analysis-of-the-latent-structure-of-process-data-via-action-seque.html
Computer simulations have become a popular tool for assessing complex skills such as problem‐solving. Log files of computer‐based items record the human–computer interactive processes for each respondent in full. The response processes are very diverse, noisy, and of non‐standard formats. Few generic methods have been developed to exploit the information contained in process data. In this paper we propose a method to extract latent variables from process data. The method utilizes a...]]>2020-05-22T07:00:00ZD‐optimal design for the Rasch counts model with multiple binary predictors
http://psychsource.bps.org.uk/details/journalArticle/11240639/Doptimal-design-for-the-Rasch-counts-model-with-multiple-binary-predictors.html
In this paper we derive optimal designs for the Rasch Poisson counts model and its extended version of the (generalized) negative binomial counts model incorporating several binary predictors for the difficulty parameter. To efficiently estimate the regression coefficients of the predictors, locally D‐optimal designs are developed. After an introduction to the Rasch Poisson counts model and its extension, we will specify these models as particular generalized linear models. Based on this...]]>2020-05-14T08:06:04ZInferences about which of J dependent groups has the largest robust measure of location
http://psychsource.bps.org.uk/details/journalArticle/11238621/Inferences-about-which-of-J-dependent-groups-has-the-largest-robust-measure-of-l.html
Recently, a multiple comparisons procedure was derived with the goal of determining whether it is reasonable to make a decision about which of J independent groups has the largest robust measure of location. This was done by testing hypotheses aimed at comparing the group with the largest estimate to the remaining J − 1 groups. It was demonstrated that for the goal of controlling the familywise error rate, meaning the probability of one or more Type I errors, well‐known improvements on the...]]>2020-05-05T19:55:47ZIssue Information
http://psychsource.bps.org.uk/details/journalArticle/11234974/Issue-Information.html
]]>2020-04-16T07:51:41ZStopping rules for multi‐category computerized classification testing
http://psychsource.bps.org.uk/details/journalArticle/11231971/Stopping-rules-for-multicategory-computerized-classification-testing.html
Computerized classification testing (CCT) aims to classify persons into one of two or more possible categories to make decisions such as mastery/non‐mastery or meet most/meet all/exceed. A defining feature of CCT is its stopping criterion: the test terminates when there is enough confidence to make a decision. There is abundant research on CCT with a single cut‐off, and two common stopping criteria are the sequential probability ratio test (SPRT) statistic and the generalized likelihood ratio...]]>2020-04-02T18:28:29Z