Polynomial Algorithms for Item Matching

Ronald D. Armstrong, Douglas H. Jones

Research output: Contribution to journalArticle

11 Citations (Scopus)

Abstract

To estimate test reliability and to create parallel tests, test items frequently are matched. Items can be matched by splitting tests into parallel test halves, by creating T splits, or by matching a desired test form. Problems often occur. Algorithms are presented to solve these problems. The algorithms are based on optimization theory in networks (graphs) and have polynomial complexity. Computational results from solving sample problems with several hundred decision variables are reported.

Original languageEnglish (US)
Pages (from-to)365-371
Number of pages7
JournalApplied Psychological Measurement
Volume16
Issue number4
DOIs
StatePublished - Dec 1992

All Science Journal Classification (ASJC) codes

  • Social Sciences (miscellaneous)
  • Psychology (miscellaneous)

Cite this

Armstrong, Ronald D. ; Jones, Douglas H. / Polynomial Algorithms for Item Matching. In: Applied Psychological Measurement. 1992 ; Vol. 16, No. 4. pp. 365-371.
@article{5e01af54b7874d459835cfcfc765d446,
title = "Polynomial Algorithms for Item Matching",
abstract = "To estimate test reliability and to create parallel tests, test items frequently are matched. Items can be matched by splitting tests into parallel test halves, by creating T splits, or by matching a desired test form. Problems often occur. Algorithms are presented to solve these problems. The algorithms are based on optimization theory in networks (graphs) and have polynomial complexity. Computational results from solving sample problems with several hundred decision variables are reported.",
author = "Armstrong, {Ronald D.} and Jones, {Douglas H.}",
year = "1992",
month = "12",
doi = "10.1177/014662169201600408",
language = "English (US)",
volume = "16",
pages = "365--371",
journal = "Applied Psychological Measurement",
issn = "0146-6216",
publisher = "SAGE Publications Inc.",
number = "4",

}

Polynomial Algorithms for Item Matching. / Armstrong, Ronald D.; Jones, Douglas H.

In: Applied Psychological Measurement, Vol. 16, No. 4, 12.1992, p. 365-371.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Polynomial Algorithms for Item Matching

AU - Armstrong, Ronald D.

AU - Jones, Douglas H.

PY - 1992/12

Y1 - 1992/12

N2 - To estimate test reliability and to create parallel tests, test items frequently are matched. Items can be matched by splitting tests into parallel test halves, by creating T splits, or by matching a desired test form. Problems often occur. Algorithms are presented to solve these problems. The algorithms are based on optimization theory in networks (graphs) and have polynomial complexity. Computational results from solving sample problems with several hundred decision variables are reported.

AB - To estimate test reliability and to create parallel tests, test items frequently are matched. Items can be matched by splitting tests into parallel test halves, by creating T splits, or by matching a desired test form. Problems often occur. Algorithms are presented to solve these problems. The algorithms are based on optimization theory in networks (graphs) and have polynomial complexity. Computational results from solving sample problems with several hundred decision variables are reported.

UR - http://www.scopus.com/inward/record.url?scp=84976933135&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84976933135&partnerID=8YFLogxK

U2 - 10.1177/014662169201600408

DO - 10.1177/014662169201600408

M3 - Article

AN - SCOPUS:84976933135

VL - 16

SP - 365

EP - 371

JO - Applied Psychological Measurement

JF - Applied Psychological Measurement

SN - 0146-6216

IS - 4

ER -