Descriptor
Author
| Choppin, Bruce | 1 |
| Formann, Anton K. | 1 |
| Jones, Patricia B. | 1 |
| Tsutakawa, Robert K. | 1 |
| Tucker, Ledyard R. | 1 |
| Zwick, Rebecca | 1 |
| van der Linden, Wim J. | 1 |
Publication Type
| Reports - Research | 6 |
| Journal Articles | 3 |
| Guides - Non-Classroom | 1 |
| Reports - General | 1 |
| Speeches/Meeting Papers | 1 |
Education Level
Audience
| Researchers | 2 |
Location
Laws, Policies, & Programs
Assessments and Surveys
What Works Clearinghouse Rating
Peer reviewedFormann, Anton K. – Psychometrika, 1986
It is shown that for equal parameters explicit formulas exist, facilitating the application of the Newton-Raphson procedure to estimate the parameters in the Rasch model and related models according to the conditional maximum likelihood principle. (Author/LMO)
Descriptors: Latent Trait Theory, Mathematical Models, Matrices, Maximum Likelihood Statistics
Peer reviewedTsutakawa, Robert K. – Journal of Educational Statistics, 1984
The EM algorithm is used to derive maximum likelihood estimates for item parameters of the two-parameter logistic item response curves. The observed information matrix is then used to approximate the covariance matrix of these estimates. Simulated data are used to compare the estimated and actual item parameters. (Author/BW)
Descriptors: Computer Simulation, Estimation (Mathematics), Latent Trait Theory, Mathematical Formulas
Peer reviewedvan der Linden, Wim J. – Applied Psychological Measurement, 1979
The restrictions on item difficulties that must be met when binomial models are applied to domain-referenced testing are examined. Both a deterministic and a stochastic conception of item responses are discussed with respect to difficulty and Guttman-type items. (Author/BH)
Descriptors: Difficulty Level, Item Sampling, Latent Trait Theory, Mathematical Models
Choppin, Bruce – 1982
A strategy for overcoming problems with the Rasch model's inability to handle missing data involves a pairwise algorithm which manipulates the data matrix to separate out the information needed for the estimation of item difficulty parameters in a test. The method of estimation compares two or three items at a time, separating out the ability…
Descriptors: Difficulty Level, Estimation (Mathematics), Goodness of Fit, Item Analysis
Jones, Patricia B.; And Others – 1987
In order to determine the effectiveness of multidimensional scaling (MDS) in recovering the dimensionality of a set of dichotomously-scored items, data were simulated in one, two, and three dimensions for a variety of correlations with the underlying latent trait. Similarity matrices were constructed from these data using three margin-sensitive…
Descriptors: Cluster Analysis, Correlation, Difficulty Level, Error of Measurement
Zwick, Rebecca – 1986
Although perfectly scalable items rarely occur in practice, Guttman's concept of a scale has proved to be valuable to the development of measurement theory. If the score distribution is uniform and there is an equal number of items at each difficulty level, both the elements and the eigenvalues of the Pearson correlation matrix of dichotomous…
Descriptors: Correlation, Difficulty Level, Item Analysis, Latent Trait Theory
Tucker, Ledyard R.; And Others – 1986
A Monte Carlo study of five indices of dimensionality of binary items used a computer model that allowed sampling of both items and people. Five parameters were systematically varied in a factorial design: (1) number of common factors from one to five; (2) number of items, including 20, 30, 40, and 60; (3) sample sizes of 125 and 500; (4) nearly…
Descriptors: Correlation, Difficulty Level, Educational Research, Expectancy Tables


