NotesFAQContact Us
Collection
Advanced
Search Tips
Showing 1 to 15 of 21 results Save | Export
Veldkamp, Bernard P. – 2002
This paper discusses optimal test construction, which deals with the selection of items from a pool to construct a test that performs optimally with respect to the objective of the test and simultaneously meets all test specifications. Optimal test construction problems can be formulated as mathematical decision models. Algorithms and heuristics…
Descriptors: Algorithms, Item Banks, Selection, Test Construction
Peer reviewed Peer reviewed
Adema, Jos J.; van der Linden, Wim J. – Journal of Educational Statistics, 1989
Two zero-one linear programing models for constructing tests using classical item and test parameters are given. These models are useful, for instance, when classical test theory must serve as an interface between an item response theory-based item banking system and a test constructor unfamiliar with the underlying theory. (TJH)
Descriptors: Algorithms, Computer Assisted Testing, Item Banks, Linear Programing
Stocking, Martha L.; And Others – 1991
A previously developed method of automatically selecting items for inclusion in a test subject to constraints on item content and statistical properties is applied to real data. Two tests are first assembled by experts in test construction who normally assemble such tests on a routine basis. Using the same pool of items and constraints articulated…
Descriptors: Algorithms, Automation, Coding, Computer Assisted Testing
Stocking, Martha L.; And Others – 1991
This paper presents a new heuristic approach to interactive test assembly that is called the successive item replacement algorithm. This approach builds on the work of W. J. van der Linden (1987) and W. J. van der Linden and E. Boekkooi-Timminga (1989) in which methods of mathematical optimization are combined with item response theory to…
Descriptors: Algorithms, Automation, Computer Selection, Heuristics
PDF pending restoration PDF pending restoration
Boekkooi-Timminga, Ellen – 1986
Nine methods for automated test construction are described. All are based on the concepts of information from item response theory. Two general kinds of methods for the construction of parallel tests are presented: (1) sequential test design; and (2) simultaneous test design. Sequential design implies that the tests are constructed one after the…
Descriptors: Algorithms, Computer Assisted Testing, Foreign Countries, Item Banks
Peer reviewed Peer reviewed
Berger, Martijn P. F. – Applied Psychological Measurement, 1994
This paper focuses on similarities of optimal design of fixed-form tests, adaptive tests, and testlets within the framework of the general theory of optimal designs. A sequential design procedure is proposed that uses these similarities to obtain consistent estimates for the trait level distribution. (SLD)
Descriptors: Achievement Tests, Adaptive Testing, Algorithms, Estimation (Mathematics)
Peer reviewed Peer reviewed
Armstrong, R. D.; And Others – Applied Psychological Measurement, 1996
When the network-flow algorithm (NFA) and the average growth approximation algorithm (AGAA) were used for automated test assembly with American College Test and Armed Services Vocational Aptitude Battery item banks, results indicate that reasonable error in item parameters is not harmful for test assembly using NFA or AGAA. (SLD)
Descriptors: Algorithms, Aptitude Tests, College Entrance Examinations, Computer Assisted Testing
Peer reviewed Peer reviewed
Armstrong, Ronald D.; And Others – Psychometrika, 1992
A method is presented and illustrated for simultaneously generating multiple tests with similar characteristics from the item bank by using binary programing techniques. The parallel tests are created to match an existing seed test item for item and to match user-supplied taxonomic specifications. (SLD)
Descriptors: Algorithms, Arithmetic, Computer Assisted Testing, Equations (Mathematics)
PDF pending restoration PDF pending restoration
Gould, R. Bruce; Christal, Raymond E. – 1976
The absence of suitable external criteria is a recurrent problem for test, battery, and inventory developers in selecting items or tests for inclusion in final operational instruments. This report presents a computing algorithm developed for use when no adequate external selection criterion is available. The algorithm uses a multiple linear…
Descriptors: Algorithms, Computer Programs, Criteria, Item Banks
Peer reviewed Peer reviewed
Armstrong, Ronald D.; And Others – Journal of Educational Statistics, 1994
A network-flow model is formulated for constructing parallel tests based on classical test theory while using test reliability as the criterion. Practitioners can specify a test-difficulty distribution for values of item difficulties as well as test-composition requirements. An empirical study illustrates the reliability of generated tests. (SLD)
Descriptors: Algorithms, Computer Assisted Testing, Difficulty Level, Item Banks
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 Linden, Wim J.; Boekkooi-Timminga, Ellen – 1987
A "maximin" model for item response theory based test design is proposed. In this model only the relative shape of the target test information function is specified. It serves as a constraint subject to which a linear programming algorithm maximizes the information in the test. In the practice of test construction there may be several…
Descriptors: Algorithms, Foreign Countries, Item Banks, Latent Trait Theory
Knol, Dirk L. – 1989
Two iterative procedures for constructing Rasch scales are presented. A log-likelihood ratio test based on a quasi-loglinear formulation of the Rasch model is given by which one item at a time can be deleted from or added to an initial item set. In the so-called "top-down" algorithm, items are stepwise deleted from a relatively large…
Descriptors: Algorithms, Item Banks, Latent Trait Theory, Mathematical Models
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
Skaggs, Gary; Stevenson, Jose – 1986
This study assesses the accuracy of ASCAL, a microcomputer-based program for estimating item parameters for the three-parameter logistic model in item response theory. Item responses are generated from a three-parameter model, and item parameter estimates from ASCAL are compared to the generating item parameters and to estimates produced by…
Descriptors: Algorithms, Comparative Analysis, Computer Software, Estimation (Mathematics)
Previous Page | Next Page ยป
Pages: 1  |  2