MétaCan
Menu
Back to cohort
Record W2001638213 · doi:10.1177/0013164406288162

Automated Simultaneous Assembly of Multistage Testlets for a High-Stakes Licensing Examination

2007· article· en· W2001638213 on OpenAlexaff
Krista Breithaupt, Donovan R. Hare

Bibliographic record

VenueEducational and Psychological Measurement · 2007
Typearticle
Languageen
FieldComputer Science
TopicSpreadsheets and End-User Computing
Canadian institutionsUniversity of British Columbia, Okanagan CampusUniversity of British Columbia
Fundersnot available
KeywordsComputerized adaptive testingTest (biology)Computer scienceCertificationConstraint (computer-aided design)Integer programmingTest Management ApproachExtension (predicate logic)AlgorithmOperations researchReliability engineeringProgramming languageMathematicsPsychometricsStatisticsEngineering

Abstract

fetched live from OpenAlex

Many challenges exist for high-stakes testing programs offering continuous computerized administration. The automated assembly of test questions to exactly meet content and other requirements, provide uniformity, and control item exposure can be modeled and solved by mixed-integer programming (MIP) methods. A case study of the computerized licensing examination of the American Institute of Certified Public Accountants is offered as one application of MIP techniques for test assembly. The solution illustrates assembly for a computer-adaptive multistage testing design. However, the general form of the constraint-based solution can be modified to generate optimal test designs for paper-based or computerized administrations, regardless of the specific psychometric model. An extension of this methodology allows for long-term planning for the production and use of test content on the basis of an exact psychometric test designs and administration schedules.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.007
metaresearch head score (Gemma)0.036
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.016
Threshold uncertainty score0.055

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0070.036
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.002
Science and technology studies0.0010.001
Scholarly communication0.0020.002
Open science0.0020.002
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0160.006

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.116
GPT teacher head0.345
Teacher spread0.229 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations28
Published2007
Admission routes1
Has abstractyes

Explore more

Same venueEducational and Psychological MeasurementSame topicSpreadsheets and End-User ComputingFrench-language works237,207