Zobrazit minimální záznam

dc.contributor.authorNguyen, Tram
dc.contributor.authorBui, Toan
dc.contributor.authorFujita, Hamido
dc.contributor.authorHong, Tzung-Pei
dc.contributor.authorLoc, Ho Dac
dc.contributor.authorSnášel, Václav
dc.contributor.authorVo, Bay
dc.date.accessioned2021-11-22T08:58:36Z
dc.date.available2021-11-22T08:58:36Z
dc.date.issued2021
dc.identifier.citationEngineering Applications of Artificial Intelligence. 2021, vol. 105, art. no. 104439.cs
dc.identifier.issn0952-1976
dc.identifier.issn1873-6769
dc.identifier.urihttp://hdl.handle.net/10084/145704
dc.description.abstractStudent evaluation is an essential part of education and is usually done through examinations. These examinations generally use tests consisting of several questions as crucial factors to determine the quality of the students. Test-making can be thought of as a multi-constraint optimization problem. However, the test-making process that is done by either manually or randomly picking questions from question banks still consumes much time and effort. Besides, the quality of the tests generated is usually not good enough. The tests may not entirely satisfy the given multiple constraints such as required test durations, number of questions, and question difficulties. In this paper, we propose parallel strategies, in which parallel migration is based on Pareto optimums, and applyan improved genetic algorithm called a genetic algorithm combined with simulated annealing, GASA, which improves diversity and accuracy of the individuals by encoding schemes and a new mutation operator of GA to handle the multiple objectives while generating multiple choice-tests from a large question bank. The proposed algorithms can use the ability to exploit historical information structure in the discovered tests, and use this to construct desired tests later. Experimental results show that the proposed approaches are efficient and effective in generating valuable tests that satisfy specified requirements. In addition, the results, when compared with those from traditional genetic algorithms, are improved in several criteria including execution time, search speed, accuracy, solution diversity, and algorithm stability.cs
dc.language.isoencs
dc.publisherElseviercs
dc.relation.ispartofseriesEngineering Applications of Artificial Intelligencecs
dc.relation.urihttps://doi.org/10.1016/j.engappai.2021.104439cs
dc.rights© 2021 Elsevier Ltd. All rights reserved.cs
dc.subjectmultiple choice-testcs
dc.subjecttest constructioncs
dc.subjectmultiple objective optimizationcs
dc.subjecttest-question bankcs
dc.subjectsimulated annealingcs
dc.subjectgenetic algorithmcs
dc.titleMultiple-objective optimization applied in extracting multiple-choice testscs
dc.typearticlecs
dc.identifier.doi10.1016/j.engappai.2021.104439
dc.type.statusPeer-reviewedcs
dc.description.sourceWeb of Sciencecs
dc.description.volume105cs
dc.description.firstpageart. no. 104439cs
dc.identifier.wos000704650900013


Soubory tohoto záznamu

SouboryVelikostFormátZobrazit

K tomuto záznamu nejsou připojeny žádné soubory.

Tento záznam se objevuje v následujících kolekcích

Zobrazit minimální záznam