Knowledge graph-assisted collaborative filtering for course recommendation in Mooc

Tieyuan Liu, Yi Chen, Liang Chang, Chuangying Zhu
{"title":"Knowledge graph-assisted collaborative filtering for course recommendation in Mooc","authors":"Tieyuan Liu, Yi Chen, Liang Chang, Chuangying Zhu","doi":"10.1117/12.2682468","DOIUrl":null,"url":null,"abstract":"Due to the Internet's tremendous expansion in recent years, quite a few students have started studying on massive open online course platforms. The information explosion of online education platforms makes it challenging for users to choose their courses effectively. The course recommendation system has become the most effective way for online education platforms to solve the above problems. One of the classic algorithms used in recommendation algorithms is collaborative filtering, but it also has many limitations: 1) Collaborative filtering is affected by cold start and sparsity easily; 2) Collaborative filtering needs to be used for rating information on courses, but the real user data in the online education platform basically does have user rating information on courses nearly, so it is challenging to apply collaborative filtering in the field of course recommendation. So, we propose an algorithm and define a formula to calculate the user's degree of interest (rating) to the course based on the user's interaction information in this paper. It adopts the knowledge graph embedding representation learning method to embed the semantic information of the course into the low-dimensional semantic space, and then use the similarity calculation formula to get the acquaintance between users according to the embedded expression and perform collaborative filtering calculation. Our method is compared with user-based collaborative filtering and item-based collaborative filtering and the model is effective on real data, according to experimental results.","PeriodicalId":177416,"journal":{"name":"Conference on Electronic Information Engineering and Data Processing","volume":"361 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Conference on Electronic Information Engineering and Data Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1117/12.2682468","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Due to the Internet's tremendous expansion in recent years, quite a few students have started studying on massive open online course platforms. The information explosion of online education platforms makes it challenging for users to choose their courses effectively. The course recommendation system has become the most effective way for online education platforms to solve the above problems. One of the classic algorithms used in recommendation algorithms is collaborative filtering, but it also has many limitations: 1) Collaborative filtering is affected by cold start and sparsity easily; 2) Collaborative filtering needs to be used for rating information on courses, but the real user data in the online education platform basically does have user rating information on courses nearly, so it is challenging to apply collaborative filtering in the field of course recommendation. So, we propose an algorithm and define a formula to calculate the user's degree of interest (rating) to the course based on the user's interaction information in this paper. It adopts the knowledge graph embedding representation learning method to embed the semantic information of the course into the low-dimensional semantic space, and then use the similarity calculation formula to get the acquaintance between users according to the embedded expression and perform collaborative filtering calculation. Our method is compared with user-based collaborative filtering and item-based collaborative filtering and the model is effective on real data, according to experimental results.
基于知识图谱的Mooc课程推荐协同过滤
由于近年来互联网的迅猛发展,相当多的学生开始在大规模的网络开放课程平台上学习。在线教育平台的信息爆炸给用户有效选课带来了挑战。课程推荐系统已成为在线教育平台解决上述问题的最有效途径。推荐算法中使用的经典算法之一是协同过滤,但它也存在许多局限性:1)协同过滤容易受到冷启动和稀疏性的影响;2)课程评价信息需要使用协同过滤,而在线教育平台的真实用户数据基本不存在用户对课程的评价信息,因此将协同过滤应用于课程推荐领域具有一定的挑战性。因此,本文提出了一种基于用户交互信息的算法,并定义了一个公式来计算用户对课程的兴趣程度(评分)。采用知识图嵌入表示学习方法将课程的语义信息嵌入到低维语义空间中,然后利用相似度计算公式根据嵌入表达式得到用户之间的熟悉度,并进行协同过滤计算。将该方法与基于用户的协同过滤和基于项目的协同过滤进行了比较,实验结果表明该模型对实际数据是有效的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信