NotesFAQContact Us
Collection
Advanced
Search Tips
Publication Type
Reports - Evaluative73
Journal Articles62
Speeches/Meeting Papers9
Reports - Research1
Education Level
Audience
Location
Laws, Policies, & Programs
What Works Clearinghouse Rating
Showing 1 to 15 of 73 results Save | Export
Peer reviewed Peer reviewed
Direct linkDirect link
Peabody, Michael R. – Measurement: Interdisciplinary Research and Perspectives, 2023
Many organizations utilize some form of automation in the test assembly process; either fully algorithmic or heuristically constructed. However, one issue with heuristic models is that when the test assembly problem changes the entire model may need to be re-conceptualized and recoded. In contrast, mixed-integer programming (MIP) is a mathematical…
Descriptors: Programming Languages, Algorithms, Heuristics, Mathematical Models
Peer reviewed Peer reviewed
Mooijaart, Ab; van der Heijden, Peter G. M. – Psychometrika, 1992
It is shown that it is not easy to apply the EM algorithm to latent class models in the general case with equality constraints because a nonlinear equation has to be solved. A simpler condition is given in which the EM algorithm can be easily applied. (SLD)
Descriptors: Algorithms, Equations (Mathematics), Estimation (Mathematics), Mathematical Models
Jiang, Hai; Tang, K. Linda – 1998
This discussion of new methods for calibrating item response theory (IRT) models looks into new optimization procedures, such as the Genetic Algorithm (GA) to improve on the use of the Newton-Raphson procedure. The advantages of using a global optimization procedure like GA is that this kind of procedure is not easily affected by local optima and…
Descriptors: Algorithms, Item Response Theory, Mathematical Models, Simulation
Peer reviewed Peer reviewed
Wood, Phillip – Multivariate Behavioral Research, 1992
Two Statistical Analysis System (SAS) macros are presented that perform the modified principal components approach of L. R. Tucker (1966) to modeling generalized learning curves analysis up to a rotation of the components. Three SAS macros are described that rotate the factor patterns to have characteristics Tucker considered desirable. (SLD)
Descriptors: Algorithms, Change, Computer Software, Factor Analysis
Peer reviewed Peer reviewed
Collins, Linda M.; Wugalter, Stuart E. – Multivariate Behavioral Research, 1992
A simulation study was conducted to determine whether latent class model parameters are recovered adequately by Latent Transition Analysis (LTA). Results indicate that parameter recovery is satisfactory overall and that the benefits of adding indicators outweigh the costs. Additional indicators also improve standard errors. An example of LTA is…
Descriptors: Algorithms, Computer Simulation, Longitudinal Studies, Mathematical Models
Peer reviewed Peer reviewed
Rindskopf, David – Psychometrika, 1992
A general approach is described for the analysis of categorical data when there are missing values on one or more observed variables. The method is based on generalized linear models with composite links. Situations in which the model can be used are described. (SLD)
Descriptors: Algorithms, Classification, Data Analysis, Estimation (Mathematics)
Peer reviewed Peer reviewed
Belbin, Lee; And Others – Multivariate Behavioral Research, 1992
A method for hierarchical agglomerative polythetic (multivariate) clustering, based on unweighted pair group using arithmetic averages (UPGMA) is compared with the original beta-flexible technique, a weighted average method. Reasons the flexible UPGMA strategy is recommended are discussed, focusing on the ability to recover cluster structure over…
Descriptors: Algorithms, Cluster Analysis, Comparative Analysis, Equations (Mathematics)
Flournoy, Nancy – 1989
Designs for sequential sampling procedures that adapt to cumulative information are discussed. A familiar illustration is the play-the-winner rule in which there are two treatments; after a random start, the same treatment is continued as long as each successive subject registers a success. When a failure occurs, the other treatment is used until…
Descriptors: Algorithms, Evaluation Methods, Mathematical Models, Research Design
Peer reviewed Peer reviewed
Lee, Sik-Yum; And Others – Psychometrika, 1989
The frequencies of "m" independent "p-way" contingency tables are analyzed by a model that assumes that the ordinal category data in each of "m" groups are generated from a latent continuous multivariate normal distribution. The model permits analysis of several groups of individuals simultaneously. (TJH)
Descriptors: Algorithms, Equations (Mathematics), Mathematical Models, Multivariate Analysis
Peer reviewed Peer reviewed
van der Linden, Wim J.; Boekkooi-Timminga, Ellen – Psychometrika, 1989
A maximin model for test design based on item response theory is proposed. Only the relative shape of target test information function is specified. It serves as a constraint subject to which a linear programing algorithm maximizes the test information. The model is illustrated, and alternative models are discussed. (TJH)
Descriptors: Algorithms, Latent Trait Theory, Linear Programing, Mathematical Models
Peer reviewed Peer reviewed
Kiers, Henk A. L.; ten Berge, Jos M. F. – Psychometrika, 1992
A procedure is described for minimizing a class of matrix trace functions, which is a refinement of an earlier procedure for minimizing the class of matrix trace functions using majorization. Several trial analyses demonstrate that the revised procedure is more efficient than the earlier majorization-based procedure. (SLD)
Descriptors: Algorithms, Equations (Mathematics), Least Squares Statistics, Mathematical Models
Peer reviewed Peer reviewed
ten Berge, Jos M. F. – Psychometrika, 1991
A globally optimal solution is presented for a class of functions composed of a linear regression function and a penalty function for the sums of squared regression weights. A completing-the-squares approach is used, rather than calculus, because it yields global minimality easily in two of three cases examined. (SLD)
Descriptors: Algorithms, Equations (Mathematics), Mathematical Models, Matrices
Peer reviewed Peer reviewed
ten Berge, Jos M. F.; Zegers, Frits E. – Multivariate Behavioral Research, 1990
Arguments by J. Levin (1988) challenging the convergence properties of the Harman and Jones (1966) method of Minres factor analysis are shown to be invalid. Claims about the invalidity of a rank-one version of the Harman and Jones method are also refuted. (TJH)
Descriptors: Algorithms, Comparative Analysis, Equations (Mathematics), Factor Analysis
Peer reviewed Peer reviewed
DeSarbo, Wayne S.; And Others – Psychometrika, 1990
A nonspatial operationalization of the Krumhansl distance-density model of similarity is presented. The conceptual model and empirical evidence are reviewed. A nonspatial, tree-fitting methodology is described, which is sufficiently flexible to fit several competing hypotheses of similarity formation. Extensions to spatial models, three-way…
Descriptors: Algorithms, Cluster Analysis, Goodness of Fit, Mathematical Models
Peer reviewed Peer reviewed
Bacon, Donald R. – Structural Equation Modeling, 2001
Evaluated the performance of several alternative cluster analytic approaches to initial model specification using population parameter analyses and a Monte Carlo simulation. Of the six cluster approaches evaluated, the one using the correlations of item correlations as a proximity metric and average linking as a clustering algorithm performed the…
Descriptors: Algorithms, Cluster Analysis, Correlation, Mathematical Models
Previous Page | Next Page ยป
Pages: 1  |  2  |  3  |  4  |  5