多群单目标粒子群优化抽取多项选择题

Tram Nguyen, T. Bui, Bay Vo
{"title":"多群单目标粒子群优化抽取多项选择题","authors":"Tram Nguyen, T. Bui, Bay Vo","doi":"10.1142/S219688881950009X","DOIUrl":null,"url":null,"abstract":"This paper proposes the use of multi-swarm method in particle swarm optimization (PSO) algorithm to generate multiple-choice tests based on assumed objective levels of difficulty. The method extracts an abundance of tests at the same time with the same levels of difficulty and approximates the difficulty-level requirement given by the users. The experimental results show that the proposed method can generate many tests from question banks satisfying predefined levels of difficulty. Additionally, the proposed method is also shown to be effective in terms of many criteria when compared with other methods such as manually extracted tests, random methods and PSO-based methods in terms of execution time, standard deviation, the number of particles per swarm and the number of swarms.","PeriodicalId":256649,"journal":{"name":"Vietnam. J. Comput. Sci.","volume":"50 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Multi-Swarm Single-Objective Particle Swarm Optimization to Extract Multiple-Choice Tests\",\"authors\":\"Tram Nguyen, T. Bui, Bay Vo\",\"doi\":\"10.1142/S219688881950009X\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes the use of multi-swarm method in particle swarm optimization (PSO) algorithm to generate multiple-choice tests based on assumed objective levels of difficulty. The method extracts an abundance of tests at the same time with the same levels of difficulty and approximates the difficulty-level requirement given by the users. The experimental results show that the proposed method can generate many tests from question banks satisfying predefined levels of difficulty. Additionally, the proposed method is also shown to be effective in terms of many criteria when compared with other methods such as manually extracted tests, random methods and PSO-based methods in terms of execution time, standard deviation, the number of particles per swarm and the number of swarms.\",\"PeriodicalId\":256649,\"journal\":{\"name\":\"Vietnam. J. Comput. Sci.\",\"volume\":\"50 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-05-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Vietnam. J. Comput. Sci.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1142/S219688881950009X\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Vietnam. J. Comput. Sci.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/S219688881950009X","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

本文提出在粒子群优化算法(PSO)中使用多群方法生成基于假设目标难度的选择题。该方法可同时提取大量难度等级相同的测试,并接近用户给出的难度等级要求。实验结果表明,该方法可以从题库中生成满足预定义难度等级的大量试题。此外,在执行时间、标准偏差、每群粒子数和群数方面,与其他方法(如手动提取测试、随机方法和基于粒子群的方法)相比,所提出的方法在许多标准方面也显示出有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Multi-Swarm Single-Objective Particle Swarm Optimization to Extract Multiple-Choice Tests
This paper proposes the use of multi-swarm method in particle swarm optimization (PSO) algorithm to generate multiple-choice tests based on assumed objective levels of difficulty. The method extracts an abundance of tests at the same time with the same levels of difficulty and approximates the difficulty-level requirement given by the users. The experimental results show that the proposed method can generate many tests from question banks satisfying predefined levels of difficulty. Additionally, the proposed method is also shown to be effective in terms of many criteria when compared with other methods such as manually extracted tests, random methods and PSO-based methods in terms of execution time, standard deviation, the number of particles per swarm and the number of swarms.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信