Optimizing the Online Learners' Verbal Intention Classification Efficiency Based on the Multi-Head Attention Mechanism Algorithm

Yangfeng Zheng, Zheng Shao, Zhanghao Gao, Mingming Deng, Xuesong Zhai
{"title":"Optimizing the Online Learners' Verbal Intention Classification Efficiency Based on the Multi-Head Attention Mechanism Algorithm","authors":"Yangfeng Zheng, Zheng Shao, Zhanghao Gao, Mingming Deng, Xuesong Zhai","doi":"10.1142/s0129054122420114","DOIUrl":null,"url":null,"abstract":"To analyse speech intention based on discussion texts in online collaborative discussions, automatic classification of discussion texts is conducted to assist teachers improve their abilities to diagnose and analyse the discussion process. The current study proposes a deep learning network model that incorporates multi-head attention mechanism with bidirectional long short-term memory (MA-BiLSTM). The proposed algorithm acquires contextual semantic connections from a global perspective and the role of key feature words within sentences from a local perspective to further strengthen the semantic features of the texts. The proposed model was employed to classify 12,000 interactive texts generated during online collaborative discussion activities. Results show that MA-BiLSTM achieved an overall classification accuracy of 83.25%, which is at least 2.83% higher than those of other baseline models. However, the classification of consultative and administrative interactive texts is minimally effective. MA-BiLSTM achieved better than the existing classification methods for interactive text classification.","PeriodicalId":192109,"journal":{"name":"Int. J. Found. Comput. Sci.","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Found. Comput. Sci.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/s0129054122420114","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

To analyse speech intention based on discussion texts in online collaborative discussions, automatic classification of discussion texts is conducted to assist teachers improve their abilities to diagnose and analyse the discussion process. The current study proposes a deep learning network model that incorporates multi-head attention mechanism with bidirectional long short-term memory (MA-BiLSTM). The proposed algorithm acquires contextual semantic connections from a global perspective and the role of key feature words within sentences from a local perspective to further strengthen the semantic features of the texts. The proposed model was employed to classify 12,000 interactive texts generated during online collaborative discussion activities. Results show that MA-BiLSTM achieved an overall classification accuracy of 83.25%, which is at least 2.83% higher than those of other baseline models. However, the classification of consultative and administrative interactive texts is minimally effective. MA-BiLSTM achieved better than the existing classification methods for interactive text classification.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于多头注意机制算法的在线学习者言语意图分类效率优化
为了分析在线协作讨论中基于讨论文本的言语意图,对讨论文本进行自动分类,帮助教师提高对讨论过程的诊断和分析能力。本研究提出了一个将多头注意机制与双向长短期记忆(MA-BiLSTM)相结合的深度学习网络模型。该算法从全局角度获取语境语义连接,从局部角度获取关键特征词在句子中的作用,进一步强化文本的语义特征。该模型用于对在线协作讨论活动中产生的12,000个交互式文本进行分类。结果表明,MA-BiLSTM总体分类准确率达到83.25%,比其他基线模型至少提高2.83%。然而,协商和行政互动文本的分类是最低限度有效的。MA-BiLSTM在交互式文本分类方面取得了比现有分类方法更好的效果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
The Hardest LL(k) Language Forbidden Patterns for FO2 Alternation Over Finite and Infinite Words Special Issue: 25th International Conference on Developments in Language Theory (DLT 2021) - Preface Transportation Problem Allowing Sending and Bringing Back Online and Approximate Network Construction from Bounded Connectivity Constraints
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1