Optimal sequential designs for on-line item estimation |
| |
Authors: | Douglas H. Jones Zhiying Jin |
| |
Affiliation: | (1) Graduate School of Management, Rutgers;(2) The State University, 92 New Street, 07102 Newark, NJ |
| |
Abstract: | Replenishing item pools for on-line ability testing requires innovative and efficient data collection designs. By generating localD-optimal designs for selecting individual examinees, and consistently estimating item parameters in the presence of error in the design points, sequential procedures are efficient for on-line item calibration. The estimating error in the on-line ability values is accounted for with an item parameter estimate studied by Stefanski and Carroll. LocallyD-optimaln-point designs are derived using the branch-and-bound algorithm of Welch. In simulations, the overall sequential designs appear to be considerably more efficient than random seeding of items.This report was prepared under the Navy Manpower, Personnel, and Training R&D Program of the Office of the Chief of Naval Research under Contract N00014-87-0696. The authors wish to acknowledge the valuable advice and consultation given by Ronald Armstrong, Charles Davis, Bradford Sympson, Zhaobo Wang, Ing-Long Wu and three anonymous reviewers. |
| |
Keywords: | branch-and-bound computerized adaptive test exactn-pointD-optimal integer programming item response theory measurement errors model on-line testing sequential design |
本文献已被 SpringerLink 等数据库收录! |
|