Automated Classification of Computing Education Questions using Bloom’s Taxonomy

James Zhang, C. Wong, Nasser Giacaman, Andrew Luxton-Reilly
{"title":"Automated Classification of Computing Education Questions using Bloom’s Taxonomy","authors":"James Zhang, C. Wong, Nasser Giacaman, Andrew Luxton-Reilly","doi":"10.1145/3441636.3442305","DOIUrl":null,"url":null,"abstract":"Bloom’s taxonomy is a well-known and widely used method of classifying assessment tasks. However, the application of Bloom’s taxonomy in computing education is often difficult and the classification often suffers from poor inter-rater reliability. Automated approaches using machine learning techniques show potential, but their performance is limited by the quality and quantity of the training set. We implement a machine learning model to classify programming questions according to Bloom’s taxonomy using Google’s BERT as the base model, and the Canterbury QuestionBank as a source of questions categorised by computing education experts. Our results demonstrate that the model was able to successfully predict the categories with moderate success, but was more successful in categorising questions at the lower levels of Bloom’s taxonomy. This work demonstrates the potential for machine learning to assist teachers in the analysis of assessment items.","PeriodicalId":334899,"journal":{"name":"Proceedings of the 23rd Australasian Computing Education Conference","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 23rd Australasian Computing Education Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3441636.3442305","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12

Abstract

Bloom’s taxonomy is a well-known and widely used method of classifying assessment tasks. However, the application of Bloom’s taxonomy in computing education is often difficult and the classification often suffers from poor inter-rater reliability. Automated approaches using machine learning techniques show potential, but their performance is limited by the quality and quantity of the training set. We implement a machine learning model to classify programming questions according to Bloom’s taxonomy using Google’s BERT as the base model, and the Canterbury QuestionBank as a source of questions categorised by computing education experts. Our results demonstrate that the model was able to successfully predict the categories with moderate success, but was more successful in categorising questions at the lower levels of Bloom’s taxonomy. This work demonstrates the potential for machine learning to assist teachers in the analysis of assessment items.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
使用Bloom分类法的计算机教育问题自动分类
Bloom分类法是一种众所周知且广泛使用的评估任务分类方法。然而,布鲁姆分类法在计算机教育中的应用往往是困难的,而且分类往往存在等级间可靠性差的问题。使用机器学习技术的自动化方法显示出潜力,但它们的性能受到训练集的质量和数量的限制。我们实现了一个机器学习模型,根据Bloom的分类法对编程问题进行分类,使用Google的BERT作为基本模型,Canterbury QuestionBank作为由计算教育专家分类的问题的来源。我们的结果表明,该模型能够成功地预测类别,并取得了中等程度的成功,但在布鲁姆分类法的较低层次上对问题进行分类时更为成功。这项工作展示了机器学习在帮助教师分析评估项目方面的潜力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Lecture Recordings, Viewing Habits, and Performance in an Introductory Programming Course A Simple, Language-Independent Approach to Identifying Potentially At-Risk Introductory Programming Students Rethinking CS0 to Improve Performance and Retention Assessing Understanding of Maintainability using Code Review Novice Difficulties with Analyzing the Running Time of Short Pieces of Code
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1