The derivations of several item selection algorithms for use in fitting test items to target information functions (IFS) are described. These algorithms circumvent iterative solutions by using the criteria of moving averages of the distance to a target IF and by simultaneously considering an entire range of ability points used to condition the IFS. The algorithms were tested by generating six forms of an ACT math test, each fit to an existing target test, including content-designated item sub sets. The results indicate that the algorithms pro vided reliable fit to the target in terms of item parameters, test information functions, and expected score distributions.
odology for creating parallel test forms using the IRT information function. Paper presented at the annual meeting of the National Council on Measurement in Education, San Francisco, CA.
3.
Adema, J.J. (1988). A note on solving large-scale zero-one programming problems (Research Rep. No. 88-4. Twente: University of Twente, Netherlands, Department of Education .
4.
Lord, F.M. (1977). Practical applications of item characteristic curve theory. Journal of Educational Measurement, 14, 117-138.
5.
Lord, F.M. (1980). Applications of item response theory to practical testing problems. Hillsdale NJ: Erlbaum.
6.
Microsoft Corp. (1987). Quick Basic 4.0 [Computer program]. Redmond WA: Microsoft Press.
7.
Samejima, F. (1977). Weakly parallel tests in latent trait theory with some criticisms of classical test theory. Psychometrika, 42, 193-198.
8.
Theunissen, T.J.J.M. (1985). Binary programming and test design. Psychometrika, 50, 411-420.
9.
van derLinden, W.J., & Boekkooi-Timminga, E. (1989). A maximin model for test design with practical constraints. Psychometrika, 54, 237-247.
