30 March 2022 in IEEE Transactions on Learning Technologies
Educational assessments often require uniform test forms, for which each test form has equivalent measurement accuracy but with a different set of items. For uniform test assembly, an important issue is the increase of the number of assembled uniform tests. Although many automatic uniform test assembly methods exist, the maximum clique algorithm (MCA)-based method is known to assemble the greatest number of uniform tests with the highest measurement accuracy based on the item response theory. In that method, the graph is constructed by sequentially adding a randomly formed test as a vertex without considering the graph structure. However, an important difficulty is its high space complexity, which interrupts search cliques with more than a hundred thousand vertices. To overcome this difficulty, this article proposes a new uniform test assembly algorithm: hybrid maximum clique algorithm using parallel integer programming. The first step searches a maximum clique that is as large as possible up to computer memory limitations using a state-of-the-art MCA with low time complexity but with high space complexity. The second step repeatedly searches a vertex connected with all vertices of the current maximum clique from the remaining vertices using integer programming with low space complexity but with high time complexity. The proposed method constructs a larger number of tests than the traditional methods do. Finally, we use simulation and actual data experiments to demonstrate the effectiveness of the proposed method. Results show that our method assembles a 1.5–2.7 times greater number of uniform tests than traditional methods can.
22 July 2021 in Behaviormetrika
9 October 2023 in IEEE Access
Recently, through the progress achieved in the study of computer science, automated test assemblies of parallel test forms, for which each form has equivalent measurement accuracy but with a different set of items, have emerged as a new standard tool. An important goal for automated test assembly is to assemble as many parallel test forms as possible. Although many automated test assembly methods exist, maximum clique using the integer programming method is known to be able to assemble the greatest number of assembled test forms with the highest measurement accuracy. Nevertheless, because of the high time complexity of integer programming, the method requires a month or more to assemble 300,000 tests. This study proposes a new automated test assembly using Zero-suppressed Binary Decision Diagrams (ZDD): a graphical representation for a set of item combinations. This representation is derived by reducing a binary decision tree. According to the proposed method, each node in the binary decision tree corresponds to an item of an item pool, which is a test item database. Each node has two edges, each signifying that the corresponding item is included in a test form or not. Furthermore, all equivalent nodes are shared, providing that they have equal measurement accuracy and equal test length. Numerical experiments demonstrate that the proposed method can assemble 1,500,000 test forms within 24 hr, although earlier methods have been capable of assembling only 300,000 test forms during a week or more.
19 February 2025 in IEEE Access
Computerized adaptive testing (CAT) presents a tradeoff dilemma involving item exposure bias and measurement accuracy. To resolve this dilemma, we propose a new two-step CAT mechanism to balance exposure bias and measurement accuracy. Using zero-suppressed binary decision diagram (ZDD), the proposed method first selects and presents an optimal item from an equivalent item pool, which uniformly divides the whole item pool. The first step rapidly provides a roughly approximated ability estimate of an examinee. The second step produces a more accurate ability estimate of the examinee. Specifically, the second step selects an optimal item from the whole item pool and presents an item with a difficulty parameter value that is approximately equal to the examinee ability estimate. Numerical experiment results underscore the effectiveness of the proposed method.
17 February 2026 in Behaviormetrika
This paper presents a review of advanced automated parallel test form assembly (ATA) methods for computer-based testing (CBT) using artificial intelligence approaches. Parallel test forms ensure equivalent measurement accuracy of examinees’ scores across different sets of question items and thereby enable assessments to be administered at any time and from any location. First, this paper presents a review of ATA methods, organizing them into four categories: Mixed-Integer Programming (MIP), multi-form MIP, metaheuristics, and form-maximization. Second, this paper describes a comparison of the characteristics of these methods in terms of measurement accuracy, accessibility, computational complexity, and feasible testing frequency. Moreover, based on these characteristics, the review presents an example decision framework for selecting ATA methods according to the requirements of CBT. Finally, numerical experiments were conducted for this study to compare representative ATA methods in terms of their relative strengths and weaknesses.