The multiple-choice (MC) item format has been widely used in educational assessments across diverse content domains. MC items purportedly allow for collecting richer diagnostic information. The effectiveness and economy of administering MC items may have further contributed to their popularity not just in educational assessment. The MC item format…

The adaptive learning problem concerns how to create an individualized learning plan (also referred to as a learning policy) that chooses the most appropriate learning materials based on a learner's latent traits. In this article, we study an important yet less-addressed adaptive learning problem--one that assumes continuous latent traits.…

Presents two binary programming models with a special network structure that can be explored computationally for simultaneous test construction. Uses an efficient special purpose network algorithm to solve these models. An empirical study illustrates the approach. (SLD)

Describes the maximum likelihood (ML) estimation of mean and covariance structure models when data are missing. Describes expectation maximization (EM), generalized expectation maximization, Fletcher-Powell, and Fisher-scoring algorithms for parameter estimation and shows how software can be used to implement each algorithm. (Author/SLD)

Examines the ways in which level-1 outliers can impact the estimation of fixed effects and random effects in hierarchical models (HMs). Also outlines and illustrates the use of Markov Chain Monte Carlo algorithms for conducting sensitivity analyses under "t" level-1 assumptions, including algorithms for settings in which the degrees of…

Ensuring item and pool security in a continuous testing environment is explored through a new method of controlling exposure rate of items conditional on ability level in computerized testing. Properties of this conditional control on exposure rate, when used in conjunction with a particular adaptive testing algorithm, are explored using simulated…

The Gibbs sampling algorithms presented by M. H. Seltzer (1993) are fully generalized to a broad range of settings in which vectors of random regression parameters in the hierarchical model are assumed multivariate normally or multivariate "t" distributed across groups. The use of a fully Bayesian approach is discussed. (SLD)

Proposes an algorithm that minimizes the asymptotic variance of the maximum-likelihood (ML) estimator of a linear combination of abilities of interest. The criterion results in a closed-form expression that is easy to evaluate. Also shows how the algorithm can be modified if the interest is in a test with a "simple ability structure."…

Practical problems with multilevel techniques are discussed. These problems relate to terminology, computer programs employing different algorithms, and interpretations of the coefficients in either one or two steps. The usefulness of hierarchical linear models (HLMs) in common situations in educational research is explored. While elegant, HLMs…