Hostname: page-component-6898cfcb55-cbk24 Total loading time: 0 Render date: 2026-11-11T23:16:44.336Z Has data issue: false hasContentIssue false
  • English
  • Français

An Automated Test Development of Parallel Tests from a Seed Test

Published online by Cambridge University Press:  01 January 2025

Ronald D. Armstrong,
Douglas H. Jones and
Ing-Long Wu
Ronald D. Armstrong
Affiliation:
Rutgers University
Douglas H. Jones*
Affiliation:
Rutgers University
Ing-Long Wu
Affiliation:
Rutgers University
*
Requests for reprints should be sent to D. H. Jones, Graduate School of Management, Rutgers, The State University of New Jersey, Newark, New Jersey 07102.
Get accessRights & Permissions [Opens in a new window]

Abstract

Binary programming models are presented to generate parallel tests from an itembank. The parallel tests are created to match item for item an existing seed test and match user supplied taxonomic specifications. The taxonomic specifications may be either obtained from the seed test or from some other user requirement. An algorithm is presented along with computational results to indicate the overall efficiency of the process. Empirical findings based on an itembank for the Arithmetic Reasoning section of the Armed Services Vocational Aptitude Battery are given.

Keywords

item response theorytest constructionnetwork optimizationbinary programmingmultiple criteria optimization

Information

Type
Original Paper
Information
Psychometrika , Volume 57 , Issue 2 , June 1992, pp. 271 - 288
Copyright
Copyright © 1992 The Psychometric Society

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

Footnotes

The Office of Naval Research, Program in Cognitive Science, N00014-87-C-0696 partially supported the work of Douglas H. Jones. The Rutgers Research Resource Committee of the Graduate School of Management partially supported the work of Douglas H. Jones and Ing-Long Wu. A Thomas and Betts research fellowship partially supported the work of Ing-Long Wu. The Human Resources Laboratory, United States Air Force, partially supported the work of Ronald Armstrong. The authors benefited from conversations with Dr. Wayne Shore, Operational Technologies, San Antonio, Texas. The order of authors' names is alphabetical and denotes equal authorship.

References

Adema, J. J., van der Linden, W. J. (1989). Algorithms for computerized test construction using classical item parameters. Journal of Educational Statistics, 14, 279–290.CrossRefGoogle Scholar
Ackerman, T. A. (1989). An alternative methodology for creating parallel test forms using the IRT information function. Paper presented at the March, 1989 NCME meeting, San Francisco, CA.Google Scholar
Baker, F. B., Cohen, A. L., Barmish, B. R. (1988). Item characteristics of tests constructed by linear programming. Applied Psychological Measurement, 12, 189–199.CrossRefGoogle Scholar
Boekkooi-Timminga, E. (1987). Simultaneous test construction by zero-one programming. Methodika, 1, 101–112.Google Scholar
Boekkooi-Timminga, E. (1990). The construction of parallel tests from IRT-based item banks. Journal of Educational Statistics, 15, 129–145.CrossRefGoogle Scholar
Carolan, W. J., Hill, J. E., Kennington, J. L., Niemi, S., Wichmann, S. J. (1990). An empirical evaluation of the KORBX algorithms for military applications. Operations Research, 38, 240–248.CrossRefGoogle Scholar
Chankong, V., Haimes, Y. Y. (1983). Multiple objective decision making: Theory and methodology, New York: North-Holland.Google Scholar
Cronbach, L. J. (1951). Coefficient alpha and the internal structure of tests. Psychometrika, 16, 297–334.CrossRefGoogle Scholar
Cunningham, W. H. (1976). A network simplex method. Mathematical Programming, 11, 105–116.CrossRefGoogle Scholar
Davis, P. J., Polonski, I. (1972). Numerical interpolation, differentiation, and integration. In Abramowitz, M., Stegun, I. A. (Eds.), Handbook of mathematical functions (pp. 875–924). New York: Dover Publications.Google Scholar
Ferguson, G. A., Takane, Y. (1989). Statistical analysis in psychology and education, New York: McGraw-Hill Company.Google Scholar
Feuerman, M., Weiss, H. (1973). A mathematical programming model for test construction and scoring. Management Science, 19, 961–966.CrossRefGoogle Scholar
Glover, F., Karney, D., Klingman, D. (1972). The augmented predecessor index method for locating stepping stones paths and assigning dual prices in distribution problems. Transportation Science, 6, 171–180.CrossRefGoogle Scholar
Glover, F., Klingman, D. (1977). Network application in industry and government. AIIE Transactions, 9, 363–376.CrossRefGoogle Scholar
Glover, F., Klingman, D. (1982). Recent developments in computer implementation technology for network flow algorithms. Information Systems and Operational Research, 20, 433–452.CrossRefGoogle Scholar
Glover, F., Klingman, D., Stutz, J. (1974). Augmented threaded index method for network optimization. Information Systems and Operational Research, 12, 377–384.CrossRefGoogle Scholar
Gulliksen, H. (1950). Theory of mental tests, New York: John Wiley & Sons.CrossRefGoogle Scholar
Kuder, G. F., Richardson, M. W. (1937). The theory and estimation of test reliability. Psychometrika, 2, 151–160.CrossRefGoogle Scholar
Lord, F. M. (1980). Applications of item response theory to practical testing problems, Hillsdale, NJ: Lawrence Erlbaum.Google Scholar
Lord, F. M., Novick, M. R. (1968). Statistical theories of mental test scores, Reading, MA: Addison-Wesley.Google Scholar
Mulvey, J. M. (1978). Pivot strategies for primal-simplex network codes. Journal of the Association for Computer Machinery, 25, 266–270.CrossRefGoogle Scholar
Nemhauser, G. L., Wolsey, L. A. (1988). Integer and combinatorial optimization, New York: John Wiley & Sons.CrossRefGoogle Scholar
Newbery, A. C. R. (1974). Numerical analysis. In Pearson, C. E. (Eds.), Handbook of applied mathematics (pp. 1002–1057). New York: Van Nostrand Reinholf Company.Google Scholar
Orlin, J. B. (1985). On the simplex algorithm for network and generalized networks. Mathematical Programming, 24, 166–178.Google Scholar
Samejima, F. (1977). Weakly parallel tests in latent trait theory with some criticisms of classical test theory. Psychometrika, 42, 193–198.CrossRefGoogle Scholar
Schrage, L. (1986). Linear, integer and quadratic programming with LINDO, Redwood City, CA: The Scientific Press.Google Scholar
Theunissen, T. J. J. M. (1985). Binary programming and test design. Psychometrika, 50, 411–420.CrossRefGoogle Scholar
Theunissen, T. J. J. M. (1986). Some applications of optimization algorithms in test design and adaptive testing. Applied Psychological Measurement, 10, 381–389.CrossRefGoogle Scholar
van der Linden, W. J., Boekkooi-Timminga, E. (1988). A zero-one programming approach to Gulliksen's random subtests. Applied Psychological Measurement, 12, 201–209.CrossRefGoogle Scholar
van der Linden, W. J., Boekkooi-Timminga, E. (1989). A maximin model for test design with practical constraints. Psychometrika, 12, 237–247.CrossRefGoogle Scholar
Yen, W. M. (1983). Use of the three-parameter model in the development of a standardized achievement test. In Hambleton, R. K. (Eds.), Applications of item response theory (pp. 123–141). Vancouver: Educational Research Institute of British Columbia.Google Scholar