Publication Date
In 2025 | 0 |
Since 2024 | 0 |
Since 2021 (last 5 years) | 2 |
Since 2016 (last 10 years) | 2 |
Since 2006 (last 20 years) | 2 |
Descriptor
Algorithms | 17 |
Simulation | 17 |
Computer Assisted Testing | 7 |
Test Items | 6 |
Adaptive Testing | 5 |
Monte Carlo Methods | 5 |
Test Construction | 5 |
Estimation (Mathematics) | 4 |
Comparative Analysis | 3 |
Difficulty Level | 3 |
Item Banks | 3 |
More ▼ |
Author
Lau, C. Allen | 2 |
Wang, Tianyou | 2 |
Ackerman, Terry A. | 1 |
Bergstrom, Betty | 1 |
Chang, Shun-Wen | 1 |
Cohen, Jonathan D. | 1 |
Corter, James E. | 1 |
Davey, Tim | 1 |
Donoghue, John R. | 1 |
Finch, Holmes | 1 |
Gershon, Richard | 1 |
More ▼ |
Publication Type
Speeches/Meeting Papers | 17 |
Reports - Evaluative | 11 |
Reports - Research | 3 |
Journal Articles | 2 |
Reports - Descriptive | 1 |
Education Level
Audience
Location
Laws, Policies, & Programs
Assessments and Surveys
National Assessment of… | 2 |
What Works Clearinghouse Rating
Zhi-Han, Yang; Zhang, Shiyue; Rafferty, Anna N. – International Educational Data Mining Society, 2022
Online educational technologies facilitate pedagogical experimentation, but typical experimental designs assign a fixed proportion of students to each condition, even if early results suggest some are ineffective. Experimental designs using multi-armed bandit (MAB) algorithms vary the probability of condition assignment for a new student based on…
Descriptors: Algorithms, Educational Experiments, Design, Simulation
Vassoyan, Jean; Vie, Jill-Jênn – International Educational Data Mining Society, 2023
Adaptive learning is an area of educational technology that consists in delivering personalized learning experiences to address the unique needs of each learner. An important subfield of adaptive learning is learning path personalization: it aims at designing systems that recommend sequences of educational activities to maximize students' learning…
Descriptors: Reinforcement, Networks, Simulation, Educational Technology

Corter, James E. – Multivariate Behavioral Research, 1998
Describes a new combinatorial algorithm for fitting additive trees to proximity data. This generalized triples method examines all triples of objects of interest in relation to the remaining set of objects to be clustered. The procedure is illustrated, and a simulation study shows its advantages. (SLD)
Descriptors: Algorithms, Simulation, Statistical Analysis
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
Finch, Holmes; Huynh, Huynh – 2000
One set of approaches to the problem of clustering with dichotomous data in cluster analysis (CA) was studied. The techniques developed for clustering with binary data involve calculating distances between observations based on the variables and then applying one of the standard CA algorithms to these distances. One of the groups of distances that…
Descriptors: Algorithms, Cluster Analysis, Monte Carlo Methods, Responses

Cohen, Jonathan D.; And Others – Psychological Review, 1990
It is proposed that attributes of automatization depend on the strength of a processing pathway, and that strength increases with training. With the Stroop effect as an example, automatic processes are shown through simulation to be continuous and to emerge gradually with practice. (SLD)
Descriptors: Algorithms, Attention, Cognitive Processes, Learning
Donoghue, John R. – 1995
A Monte Carlo study compared the usefulness of six variable weighting methods for cluster analysis. Data were 100 bivariate observations from 2 subgroups, generated according to a finite normal mixture model. Subgroup size, within-group correlation, within-group variance, and distance between subgroup centroids were manipulated. Of the clustering…
Descriptors: Algorithms, Cluster Analysis, Comparative Analysis, Correlation
Lau, C. Allen; Wang, Tianyou – 1999
A study was conducted to extend the sequential probability ratio testing (SPRT) procedure with the polytomous model under some practical constraints in computerized classification testing (CCT), such as methods to control item exposure rate, and to study the effects of other variables, including item information algorithms, test difficulties, item…
Descriptors: Algorithms, Computer Assisted Testing, Difficulty Level, Item Banks
Wulfeck, Wallace H., II – 1977
This paper describes an investigation of problem sequencing as part of a symposium presenting theoretical concerns and research findings regarding several diverse types of strategies for designing and presenting instructional materials. The first step involved analyzing a set of problems, to determine the knowledge (rules) required for solving the…
Descriptors: Algorithms, Computer Science, Curriculum Design, Educational Research
Gershon, Richard; Bergstrom, Betty – 1995
When examinees are allowed to review responses on an adaptive test, can they "cheat" the adaptive algorithm in order to take an easier test and improve their performance? Theoretically, deliberately answering items incorrectly will lower the examinee ability estimate and easy test items will be administered. If review is then allowed,…
Descriptors: Adaptive Testing, Algorithms, Cheating, Computer Assisted Testing
Davey, Tim; Parshall, Cynthia G. – 1995
Although computerized adaptive tests acquire their efficiency by successively selecting items that provide optimal measurement at each examinee's estimated level of ability, operational testing programs will typically consider additional factors in item selection. In practice, items are generally selected with regard to at least three, often…
Descriptors: Ability, Adaptive Testing, Algorithms, Computer Assisted Testing
Ackerman, Terry A. – 1991
This paper examines the effect of using unidimensional item response theory (IRT) item parameter estimates of multidimensional items to create weakly parallel test forms using target information curves. To date, all computer-based algorithms that have been devised to create parallel test forms assume that the items are unidimensional. This paper…
Descriptors: Algorithms, Equations (Mathematics), Estimation (Mathematics), Item Response Theory
Kletsky, E. J. – 1975
This paper describes a student project in digital simulation techniques that is part of a graduate systems analysis course entitled Biosimulation. The students chose different simulation techniques to solve a problem related to the neuron model. (MLH)
Descriptors: Algorithms, Biophysics, Computers, Engineering
Yan, Duanli; Lewis, Charles; Stocking, Martha – 1998
It is unrealistic to suppose that standard item response theory (IRT) models will be appropriate for all new and currently considered computer-based tests. In addition to developing new models, researchers will need to give some attention to the possibility of constructing and analyzing new tests without the aid of strong models. Computerized…
Descriptors: Adaptive Testing, Algorithms, Computer Assisted Testing, Item Response Theory
Lau, C. Allen; Wang, Tianyou – 2000
This paper proposes a new Information-Time index as the basis for item selection in computerized classification testing (CCT) and investigates how this new item selection algorithm can help improve test efficiency for item pools with mixed item types. It also investigates how practical constraints such as item exposure rate control, test…
Descriptors: Algorithms, Classification, Computer Assisted Testing, Elementary Secondary Education
Previous Page | Next Page »
Pages: 1 | 2