Multi-Swarm Optimization for Extracting Multiple-Choice Tests From Question Banks

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F21%3A10248865" target="_blank" >RIV/61989100:27240/21:10248865 - isvavai.cz</a>

Result on the web

<a href="https://ieeexplore.ieee.org/document/9348944" target="_blank" >https://ieeexplore.ieee.org/document/9348944</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1109/ACCESS.2021.3057515" target="_blank" >10.1109/ACCESS.2021.3057515</a>

Result language

angličtina

Original language name

Multi-Swarm Optimization for Extracting Multiple-Choice Tests From Question Banks

Original language description

In this study, a novel method for generating multiple-choice tests is presented, which extracts the required number of tests of the same levels of difficulty in a single attempt and approximates the difficulty level requirement given by users. We propose an approach using parallelism and Pareto optimization for multi-swarm migration in a particle swarm optimization (PSO) algorithm. Multi-PSO is proposed for shortening the computing time. The proposed migration of PSOs increases the diversity of tests and controls the overlap of extracted tests. The experimental results show that the proposed method can generate many tests from question banks satisfying predefined levels of difficulty. Additionally, the developed method is shown to be effective in terms of many criteria when compared with other methods such as manually extracted tests, a simulated annealing algorithm (SA), random methods and PSO-based approaches in terms of the number of successful solutions, accuracy, standard deviation, search speed, and the number of questions overlapping between the exam questions, as well as for changing the search space, changing the number of individuals, changing the number of swarms, and changing the difficulty requirements.

Czech name

—

Czech description

—

Type

J_imp - Article in a specialist periodical, which is included in the Web of Science database

CEP classification

—

OECD FORD branch

10200 - Computer and information sciences

Project

—

Continuities

S - Specificky vyzkum na vysokych skolach

Publication year

2021

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

IEEE Access

ISSN

2169-3536

e-ISSN

—

Volume of the periodical

9

Issue of the periodical within the volume

14.3.2021

Country of publishing house

US - UNITED STATES

Number of pages

18

Pages from-to

32131-32148

UT code for WoS article

000623414400001

EID of the result in the Scopus database

—