@article {401,
	title = {Assembling a computerized adaptive testing item pool as a set of linear tests},
	journal = {Journal of Educational and Behavioral Statistics},
	volume = {31},
	number = {1},
	year = {2006},
	pages = {81-99},
	publisher = {Sage Publications: US},
	abstract = {Test-item writing efforts typically results in item pools with an undesirable correlational structure between the content attributes of the items and their statistical information. If such pools are used in computerized adaptive testing (CAT), the algorithm may be forced to select items with less than optimal information, that violate the content constraints, and/or have unfavorable exposure rates. Although at first sight somewhat counterintuitive, it is shown that if the CAT pool is assembled as a set of linear test forms, undesirable correlations can be broken down effectively. It is proposed to assemble such pools using a mixed integer programming model with constraints that guarantee that each test meets all content specifications and an objective function that requires them to have maximal information at a well-chosen set of ability values. An empirical example with a previous master pool from the Law School Admission Test (LSAT) yielded a CAT with nearly uniform bias and mean-squared error functions for the ability estimator and item-exposure rates that satisfied the target for all items in the pool. },
	keywords = {Algorithms, computerized adaptive testing, item pool, linear tests, mathematical models, statistics, Test Construction, Test Items},
	isbn = {1076-9986 (Print)},
	author = {van der Linden, W. J. and Ariel, A. and Veldkamp, B. P.}
}
@article {208,
	title = {Infeasibility in automated test assembly models: A comparison study of different methods},
	journal = {Journal of Educational Measurement},
	volume = {42},
	number = {3},
	year = {2005},
	pages = {223-243},
	abstract = {Several techniques exist to automatically put together a test meeting a number of specifications. In an item bank, the items are stored with their characteristics. A test is constructed by selecting a set of items that fulfills the specifications set by the test assembler. Test assembly problems are often formulated in terms of a model consisting of restrictions and an objective to be maximized or minimized. A problem arises when it is impossible to construct a test from the item pool that meets all specifications, that is, when the model is not feasible. Several methods exist to handle these infeasibility problems. In this article, test assembly models resulting from two practical testing programs were reconstructed to be infeasible. These models were analyzed using methods that forced a solution (Goal Programming, Multiple-Goal Programming, Greedy Heuristic), that analyzed the causes (Relaxed and Ordered Deletion Algorithm (RODA), Integer Randomized Deletion Algorithm (IRDA), Set Covering (SC), and Item Sampling), or that analyzed the causes and used this information to force a solution (Irreducible Infeasible Set-Solver). Specialized methods such as the IRDA and the Irreducible Infeasible Set-Solver performed best. Recommendations about the use of different methods are given. (PsycINFO Database Record (c) 2005 APA ) (journal abstract)},
	keywords = {Algorithms, Item Content (Test), Models, Test Construction},
	author = {Huitzing, H. A. and Veldkamp, B. P. and Verschoor, A. J.}
}
@article {408,
	title = {Constraining item exposure in computerized adaptive testing with shadow tests},
	journal = {Journal of Educational and Behavioral Statistics},
	volume = {29},
	number = {3},
	year = {2004},
	pages = {273-291},
	publisher = {American Educational Research Assn: US},
	abstract = {Item-exposure control in computerized adaptive testing is implemented by imposing item-ineligibility constraints on the assembly process of the shadow tests. The method resembles Sympson and Hetter{\textquoteright}s (1985) method of item-exposure control in that the decisions to impose the constraints are probabilistic. The method does not, however, require time-consuming simulation studies to set values for control parameters before the operational use of the test. Instead, it can set the probabilities of item ineligibility adaptively during the test using the actual item-exposure rates. An empirical study using an item pool from the Law School Admission Test showed that application of the method yielded perfect control of the item-exposure rates and had negligible impact on the bias and mean-squared error functions of the ability estimator. },
	keywords = {computerized adaptive testing, item exposure control, item ineligibility constraints, Probability, shadow tests},
	isbn = {1076-9986 (Print)},
	author = {van der Linden, W. J. and Veldkamp, B. P.}
}
@article {10,
	title = {Constructing rotating item pools for constrained adaptive testing},
	journal = {Journal of Educational Measurement},
	volume = {41},
	number = {4},
	year = {2004},
	pages = {345-359},
	publisher = {Blackwell Publishing: United Kingdom},
	abstract = {Preventing items in adaptive testing from being over- or underexposed is one of the main problems in computerized adaptive testing. Though the problem of overexposed items can be solved using a probabilistic item-exposure control method, such methods are unable to deal with the problem of underexposed items. Using a system of rotating item pools, on the other hand, is a method that potentially solves both problems. In this method, a master pool is divided into (possibly overlapping) smaller item pools, which are required to have similar distributions of content and statistical attributes. These pools are rotated among the testing sites to realize desirable exposure rates for the items. A test assembly model, motivated by Gulliksen{\textquoteright}s matched random subtests method, was explored to help solve the problem of dividing a master pool into a set of smaller pools. Different methods to solve the model are proposed. An item pool from the Law School Admission Test was used to evaluate the performances of computerized adaptive tests from systems of rotating item pools constructed using these methods. (PsycINFO Database Record (c) 2007 APA, all rights reserved)},
	keywords = {computerized adaptive tests, constrained adaptive testing, item exposure, rotating item pools},
	isbn = {0022-0655 (Print)},
	author = {Ariel, A. and Veldkamp, B. P. and van der Linden, W. J.}
}
@article {418,
	title = {Mathematical-programming approaches to test item pool design},
	number = {RR 02-09},
	year = {2002},
	note = {Using Smart Source ParsingAdvances in psychology research, Vol. ( Hauppauge, NY : Nova Science Publishers, Inc, [URL:http://www.Novapublishers.com]. vi, 228 pp},
	pages = {93-108},
	institution = {University of Twente, Faculty of Educational Science and Technology},
	address = {Twente, The Netherlands},
	abstract = {(From the chapter) This paper presents an approach to item pool design that has the potential to improve on the quality of current item pools in educational and psychological testing and hence to increase both measurement precision and validity. The approach consists of the application of mathematical programming techniques to calculate optimal blueprints for item pools. These blueprints can be used to guide the item-writing process. Three different types of design problems are discussed, namely for item pools for linear tests, item pools computerized adaptive testing (CAT), and systems of rotating item pools for CAT. The paper concludes with an empirical example of the problem of designing a system of rotating item pools for CAT.},
	keywords = {Adaptive Testing, Computer Assisted, Computer Programming, Educational Measurement, Item Response Theory, Mathematics, Psychometrics, Statistical Rotation computerized adaptive testing, Test Items, Testing},
	isbn = {02-09},
	author = {Veldkamp, B. P. and van der Linden, W. J. and Ariel, A.}
}
@article {409,
	title = {An integer programming approach to item bank design},
	journal = {Applied Psychological Measurement},
	volume = {24},
	number = {2},
	year = {2000},
	pages = {139-150},
	abstract = {An integer programming approach to item bank design is presented that can be used to calculate an optimal blueprint for an item bank, in order to support an existing testing program. The results are optimal in that they minimize the effort involved in producing the items as revealed by current item writing patterns. Also presented is an adaptation of the models, which can be used as a set of monitoring tools in item bank management. The approach is demonstrated empirically for an item bank that was designed for the Law School Admission Test. },
	keywords = {Aptitude Measures, Item Analysis (Test), Item Response Theory, Test Construction, Test Items},
	author = {van der Linden, W. J. and Veldkamp, B. P. and Reese, L. M.}
}
