Publication Date
In 2025 | 0 |
Since 2024 | 0 |
Since 2021 (last 5 years) | 1 |
Since 2016 (last 10 years) | 1 |
Since 2006 (last 20 years) | 1 |
Descriptor
Author
Publication Type
Reports - Evaluative | 17 |
Journal Articles | 9 |
Speeches/Meeting Papers | 2 |
Information Analyses | 1 |
Numerical/Quantitative Data | 1 |
Education Level
Audience
Researchers | 1 |
Location
Australia | 1 |
Netherlands | 1 |
Laws, Policies, & Programs
Assessments and Surveys
What Works Clearinghouse Rating
Donald Secreast – CEA Forum, 2023
"Using Sentiment Analysis to Ease Students toward or around Macroanalysis" introduces teachers to the mathematical analytical method currently being promoted by Matthew Jockers which he calls macroanalysis. This method uses an algorithm called "R," originally designed by researchers in sociology. In many ways, macroanalysis…
Descriptors: Literary Criticism, Statistical Analysis, Algorithms, Computer Uses in Education

Kiers, Henk A. L.; ten Berge, Jos M. F. – Psychometrika, 1989
Two alternating least squares algorithms are presented for the simultaneous components analysis method of R. E. Millsap and W. Meredith (1988). These methods, one for small data sets and one for large data sets, can indicate whether or not a global optimum for the problem has been attained. (SLD)
Descriptors: Algorithms, Factor Analysis, Least Squares Statistics, Statistical Analysis
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

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
Knol, Dirk L.; ten Berge, Jos M. F. – 1987
An algorithm is presented for the best least-squares fitting correlation matrix approximating a given missing value or improper correlation matrix. The proposed algorithm is based on a solution for C. I. Mosier's oblique Procrustes rotation problem offered by J. M. F. ten Berge and K. Nevels (1977). It is shown that the minimization problem…
Descriptors: Algorithms, Computer Software, Correlation, Estimation (Mathematics)

Gigerenzer, Gerd; Hoffrage, Ulrich – Psychological Review, 1995
It is shown that Bayesian algorithms are computationally simpler in frequency formats than in the probability formats used in previous research. Analysis of several thousand solutions to Bayesian problems showed that when information was presented in frequency formats, statistically naive participants derived up to 50% of inferences by Bayesian…
Descriptors: Algorithms, Bayesian Statistics, Computation, Estimation (Mathematics)

Kiers, Henk A. L. – Psychometrika, 1989
An alternating least squares algorithm is offered for fitting the DEcomposition into DIrectional COMponents (DEDICOM) model for representing asymmetric relations among a set of objects via a set of coordinates for the objects on a limited number of dimensions. An algorithm is presented for fitting the IDIOSCAL model in the least squares sense.…
Descriptors: Algorithms, Estimation (Mathematics), Goodness of Fit, Least Squares Statistics

Rost, Jurgen – Psychometrika, 1988
A general approach for analyzing rating data with latent class models is described, paralleling rating models in the framework of latent trait theory. A general rating model and a two-parameter model with location and dispersion parameters are derived and illustrated. (Author/SLD)
Descriptors: Algorithms, Equations (Mathematics), Estimation (Mathematics), Latent Trait Theory

Young, Martin R.; DeSarbo, Wayne S. – Psychometrika, 1995
A new parametric maximum likelihood procedure is proposed for estimating ultrametric trees for the analysis of conditional rank order proximity data. Technical aspects of the model and the estimation algorithm are discussed, and Monte Carlo results illustrate its application. A consumer psychology application is also examined. (SLD)
Descriptors: Algorithms, Consumer Economics, Estimation (Mathematics), Maximum Likelihood Statistics

Marty, Fernand; Hart, Robert S. – 1985
The process of developing a computer program that can turn French text into speech is described. The program is designed to change a conventionally-spelled text into a phonemic transcription with an accuracy level of over 99.9%, divide the text into breath-groups that are syntactically correct and not over 14 syllables long, treat the unstable…
Descriptors: Algorithms, Computational Linguistics, Computer Software, French

Stocking, Martha L.; Swanson, Len – Applied Psychological Measurement, 1993
A method is presented for incorporating a large number of constraints on adaptive item selection in the construction of computerized adaptive tests. The method, which emulates practices of expert test specialists, is illustrated for verbal and quantitative measures. Its foundation is application of a weighted deviations model and algorithm. (SLD)
Descriptors: Adaptive Testing, Algorithms, Computer Assisted Testing, Expert Systems
The Comparability of the Statistical Characteristics of Test Items Generated by Computer Algorithms.
Meisner, Richard; And Others – 1993
This paper presents a study on the generation of mathematics test items using algorithmic methods. The history of this approach is briefly reviewed and is followed by a survey of the research to date on the statistical parallelism of algorithmically generated mathematics items. Results are presented for 8 parallel test forms generated using 16…
Descriptors: Algorithms, Comparative Analysis, Computer Assisted Testing, Item Banks
van der Burg, Eeke; de Leeuw, Jan – 1988
A non-linear version of redundancy analysis is introduced. The technique is called REDUNDALS. It is implemented within the computer program for canonical correlation analysis called CANALS. The REDUNDALS algorithm is of an alternating least square (ALS) type. The technique is defined as minimization of a squared distance between criterion…
Descriptors: Algorithms, Attitude Measures, Computer Oriented Programs, Correlation

Smyth, G. K.; And Others – Australian Journal of Education, 1990
A method for predicting freshman performance based on high school grades allows calculation of any student's likely grades in a similar university course. The method is contrasted with several more traditional predictive methods and examined in a study of 3,734 University of Western Australia students. (MSE)
Descriptors: Academic Achievement, Algorithms, College Freshmen, Comparative Analysis
Brinkman, Paul T.; Niwa, Shelley – 1983
Recent developments in econometrics that are relevant to the task of estimating costs in higher education are reviewed. The relative effectiveness of alternative statistical procedures for estimating costs are also tested. Statistical cost estimation involves three basic parts: a model, a data set, and an estimation procedure. Actual data are used…
Descriptors: Algorithms, College Students, Cost Estimates, Full Time Students
Previous Page | Next Page ยป
Pages: 1 | 2