NotesFAQContact Us
Collection
Advanced
Search Tips
Showing all 8 results Save | Export
Peer reviewed Peer reviewed
Messick, Samuel – Psychometrika, 1981
Bond criticized the base-free measure of change proposed by Tucker, Damarin, and Messick by pointing to an incorrect derivation which is here viewed instead as a correct derivation entailing an inadequately specified assumption. Bond's revision leads to negatively biased estimates, whereas the original approach leads to unbiased estimates.…
Descriptors: Algorithms, Change, Correlation, Mathematical Formulas
Peer reviewed Peer reviewed
Bentler, P. M.; Tanaka, Jeffrey S. – Psychometrika, 1983
Rubin and Thayer recently presented equations to implement maximum likelihood estimation in factor analysis via the EM algorithm. It is argued here that the advantages of using the EM algorithm remain to be demonstrated. (Author/JKS)
Descriptors: Algorithms, Factor Analysis, Maximum Likelihood Statistics, Research Problems
Peer reviewed Peer reviewed
Rubin, Donald B.; Thayer, Dorothy T. – Psychometrika, 1983
The authors respond to a criticism of their earlier article concerning the use of the EM algorithm in maximum likelihood factor analysis. Also included are the comments made by the reviewers of this article. (JKS)
Descriptors: Algorithms, Estimation (Mathematics), Factor Analysis, Maximum Likelihood Statistics
Linacre, John M.; Wright, Benjamin D. – 1987
The Mantel-Haenszel (MH) procedure attempts to identify and quantify differential item performance (item bias). This paper summarizes the MH statistics, and identifies the parameters they estimate. An equivalent procedure based on the Rasch model is described. The theoretical properties of the two approaches are compared and shown to require the…
Descriptors: Algorithms, Estimation (Mathematics), Item Analysis, Measurement Techniques
van der Linden, Wim J.; Adema, Jos J. – 1988
Two optimalization models for the construction of tests with a maximal value of coefficient alpha are given. Both models have a linear form and can be solved by using a branch-and-bound algorithm. The first model assumes an item bank calibrated under the Rasch model and can be used, for instance, when classical test theory has to serve as an…
Descriptors: Algorithms, Computer Simulation, Estimation (Mathematics), Foreign Countries
Bejar, Isaac I. – 1986
This report summarizes the results of research designed to study the psychometric and technological feasibility of adaptive testing to assess spatial ability. Data was collected from high school students on two types of spatial items: three-dimensional cubes and hidden figure items. The analysis of the three-dimensional cubes focused on the fit of…
Descriptors: Adaptive Testing, Algorithms, Cognitive Measurement, Computer Assisted Testing
Hofmann, Rich; Sherman, Larry – 1991
Using data from 135 sixth-, seventh-, and eighth-graders between 11 and 15 years old attending a middle school in a suburban Southwest Ohio school district, two hypothesized models of the factor structures for the Coopersmith Self-Esteem Inventory were tested. One model represents the original Coopersmith factor structure, and the other model is…
Descriptors: Adolescents, Algorithms, Chi Square, Factor Structure
Wainer, Howard; Kiely, Gerard L. – 1986
Recent experience with the Computerized Adaptive Test (CAT) has raised a number of concerns about its practical applications. The concerns are principally involved with the concept of having the computer construct the test from a precalibrated item pool, and substituting statistical characteristics for the test developer's skills. Problems with…
Descriptors: Adaptive Testing, Algorithms, Computer Assisted Testing, Construct Validity