This Article Full Text (PDF) References Alert me when this article is cited Alert me if a correction is posted Services Email this article to a friend Similar articles in this journal Alert me to new issues of the journal Add to Saved Citations Download to citation manager Request Permissions Request Reprints Add to My Marked Citations Citing Articles Citing Articles via HighWire Citing Articles via Google Scholar Citing Articles via Scopus Google Scholar Articles by van der Linden, W. J. Articles by Boekkooi-Timminga, E. Search for Related Content Social Bookmarking                         What's this?

A Zero-One Programming Approach to Guiliksen's Matched Random Subtests Method

University of Twente

Ellen Boekkooi-Timminga

University of Twente

Gulliksen's matched random subtests method is a graphical method to split a test into parallel test halves. The method has practical relevance because it maximizes coefficient as a lower bound to the clas sical test reliability coefficient. In this paper the same problem is formulated as a zero-one programming problem, the advantage being that it can be solved by computer algorithms that already exist. It is shown how the procedure can be generalized to split tests of any length. The paper concludes with an empirical ex ample comparing Gulliksen's original hand-method with the zero-one programming version. Index terms: Classical test theory, Gulliksen's matched ran dom subtests method, Item matching, Linear program ming, Parallel tests, Test reliability, Zero-one pro gramming.

Applied Psychological Measurement, Vol. 12, No. 2, 201-209 (1988)
DOI: 10.1177/014662168801200210


CiteULike    Complore    Connotea    Del.icio.us    Digg    Reddit    Technorati    Twitter    What's this?

This article has been cited by other articles:

				I.-L. Wu A New Computer Algorithm for Simultaneous Test Construction of Two-Stage and Multistage Testing Journal of Educational and Behavioral Statistics, January 1, 2001; 26(2): 180 - 198. [Abstract] [PDF]

				R. D. Armstrong, D. H. Jones, and Z. Wang Automated Parallel Test Construction Using Classical Test Theory Journal of Educational and Behavioral Statistics, January 1, 1994; 19(1): 73 - 90. [Abstract] [PDF]

				R. D. Armstrong and D. H. Jones Polynomial Algorithms for Item Matching Applied Psychological Measurement, December 1, 1992; 16(4): 365 - 371. [PDF]

				E. Boekkooi-Timminga The Construction of Parallel Tests From IRT-Based Item Banks Journal of Educational and Behavioral Statistics, January 1, 1990; 15(2): 129 - 145. [Abstract] [PDF]