NotesFAQContact Us
Collection
Advanced
Search Tips
Showing all 4 results Save | Export
Peer reviewed Peer reviewed
Jamshidian, Mortaza; Bentler, Peter M. – Journal of Educational and Behavioral Statistics, 1999
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)
Descriptors: Algorithms, Estimation (Mathematics), Maximum Likelihood Statistics, Scoring
Peer reviewed Peer reviewed
Seltzer, Michael; Novak, John; Choi, Kilchan; Lim, Nelson – Journal of Educational and Behavioral Statistics, 2002
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…
Descriptors: Algorithms, Estimation (Mathematics), Markov Processes, Monte Carlo Methods
Peer reviewed Peer reviewed
Seltzer, Michael H.; And Others – Journal of Educational and Behavioral Statistics, 1996
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)
Descriptors: Algorithms, Bayesian Statistics, Estimation (Mathematics), Multivariate Analysis
Peer reviewed Peer reviewed
van der Linden, Wim J. – Journal of Educational and Behavioral Statistics, 1999
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."…
Descriptors: Ability, Adaptive Testing, Algorithms, Computer Assisted Testing