Personalization exercise recommendation framework based on knowledge concept graph

IF 1.2 4区 计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS Computer Science and Information Systems Pub Date : 2023-01-01 DOI:10.2298/csis220706024y
Zhang Yan, Hongle Du, Zhang Lin, Jianhua Zhao
{"title":"Personalization exercise recommendation framework based on knowledge concept graph","authors":"Zhang Yan, Hongle Du, Zhang Lin, Jianhua Zhao","doi":"10.2298/csis220706024y","DOIUrl":null,"url":null,"abstract":"With the explosive increase of online learning resources, how to provide students with personalized learning resources and achieve the goal of precise teaching has become a research hotspot in the field of computer-assisted teaching. In personalized learning resource recommendation, exercise recommendation is the most commonly used and most representative research direction, which has attracted the attention of a large number of scholars. Aiming at this, a personalized exercise recommendation framework is proposed in this paper. First, it automatically constructs the relationship matrix between questions and concepts based on students' answering records (abbreviated as Q-matrix). Then based on the Q-matrix and answer records, deep knowledge tracing is used to automatically build the course knowledge graph. Then, based on each student's answer records, Q-matrix and the course knowledge graph, a recommendation algorithm is designed to obtain the knowledge structure diagram of every student. Combined the knowledge structure diagram and constructivist learning theory, get candidate recommended exercises from the exercise bank. Finally, based on their diversity, difficulty, novelty and other characteristics, exercises are filtered and obtain the exercises recommended to students. In the experimental part, the proposed framework is compared with other algorithms on the real data set. The experimental results of the proposed algorithm are close to the current mainstream algorithms without the Q-matrix and curriculum knowledge graph, and the experimental results of some indicators are better than Algorithms exist.","PeriodicalId":50636,"journal":{"name":"Computer Science and Information Systems","volume":null,"pages":null},"PeriodicalIF":1.2000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Science and Information Systems","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.2298/csis220706024y","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

With the explosive increase of online learning resources, how to provide students with personalized learning resources and achieve the goal of precise teaching has become a research hotspot in the field of computer-assisted teaching. In personalized learning resource recommendation, exercise recommendation is the most commonly used and most representative research direction, which has attracted the attention of a large number of scholars. Aiming at this, a personalized exercise recommendation framework is proposed in this paper. First, it automatically constructs the relationship matrix between questions and concepts based on students' answering records (abbreviated as Q-matrix). Then based on the Q-matrix and answer records, deep knowledge tracing is used to automatically build the course knowledge graph. Then, based on each student's answer records, Q-matrix and the course knowledge graph, a recommendation algorithm is designed to obtain the knowledge structure diagram of every student. Combined the knowledge structure diagram and constructivist learning theory, get candidate recommended exercises from the exercise bank. Finally, based on their diversity, difficulty, novelty and other characteristics, exercises are filtered and obtain the exercises recommended to students. In the experimental part, the proposed framework is compared with other algorithms on the real data set. The experimental results of the proposed algorithm are close to the current mainstream algorithms without the Q-matrix and curriculum knowledge graph, and the experimental results of some indicators are better than Algorithms exist.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于知识概念图的个性化习题推荐框架
随着网络学习资源的爆炸式增长,如何为学生提供个性化的学习资源,实现精准教学的目标,成为计算机辅助教学领域的研究热点。在个性化学习资源推荐中,运动推荐是最常用、最具代表性的研究方向,引起了大量学者的关注。针对此,本文提出了一种个性化的运动推荐框架。首先,根据学生的答题记录,自动构建问题与概念之间的关系矩阵(简称q矩阵)。然后基于q矩阵和答题记录,采用深度知识跟踪技术自动构建课程知识图谱。然后,根据每个学生的答题记录、q矩阵和课程知识图,设计推荐算法,得到每个学生的知识结构图。结合知识结构图和建构主义学习理论,从练习库中获得考生推荐练习。最后,根据习题的多样性、难度、新颖性等特点,对习题进行筛选,得到推荐给学生的习题。在实验部分,将该框架与其他算法在真实数据集上进行了比较。本文算法的实验结果接近目前主流算法,没有q矩阵和课程知识图,部分指标的实验结果优于现有算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Computer Science and Information Systems
Computer Science and Information Systems COMPUTER SCIENCE, INFORMATION SYSTEMS-COMPUTER SCIENCE, SOFTWARE ENGINEERING
CiteScore
2.30
自引率
21.40%
发文量
76
审稿时长
7.5 months
期刊介绍: About the journal Home page Contact information Aims and scope Indexing information Editorial policies ComSIS consortium Journal boards Managing board For authors Information for contributors Paper submission Article submission through OJS Copyright transfer form Download section For readers Forthcoming articles Current issue Archive Subscription For reviewers View and review submissions News Journal''s Facebook page Call for special issue New issue notification Aims and scope Computer Science and Information Systems (ComSIS) is an international refereed journal, published in Serbia. The objective of ComSIS is to communicate important research and development results in the areas of computer science, software engineering, and information systems.
期刊最新文献
Reviewer Acknowledgements for Computer and Information Science, Vol. 16, No. 3 Drawbacks of Traditional Environmental Monitoring Systems Improving the Classification Ability of Delegating Classifiers Using Different Supervised Machine Learning Algorithms Reinforcement learning - based adaptation and scheduling methods for multi-source DASH On the Convergence of Hypergeometric to Binomial Distributions
×
引用
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