Cascaded Knowledge-Level Fusion Network for Online Course Recommendation System

IF 7.5 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS IEEE Transactions on Big Data Pub Date : 2023-12-25 DOI:10.1109/TBDATA.2023.3346711
Wenjun Ma;Yibing Zhao;Xiaomao Fan
{"title":"Cascaded Knowledge-Level Fusion Network for Online Course Recommendation System","authors":"Wenjun Ma;Yibing Zhao;Xiaomao Fan","doi":"10.1109/TBDATA.2023.3346711","DOIUrl":null,"url":null,"abstract":"In light of the global proliferation of the COVID-19 pandemic, there is a notable surge in public interest towards Massive Open Online Courses (MOOCs) recently. Within the realm of personalized course-learning services, large amounts of online course recommendation systems have been developed to cater to the diverse needs of learners. However, despite these advancements, there still exist three unsolved challenges: 1) how to effectively utilize the course information spanning from the title-level to the more granular keyword-level; 2) how to well capture the sequential information among learning courses; 3) how to identify the high-correlated courses in the course corpora. To address these challenges, we propose a novel solution known as \n<bold>C</b>\nascaded \n<bold>K</b>\nnowledge-level \n<bold>F</b>\nusion \n<bold>N</b>\network (CKFN) for online course recommendation with incorporating a three-fold approach to maximize the utilization of course information: 1) two knowledge graphs spanning from the keyword-level to title-level; 2) a two-stage attention fusion mechanism; 3) a novel knowledge-aware negative sampling method. Experimental results on a real dataset of XuetangX demonstrate that CKFN surpasses existing baseline models by a substantial margin, thereby achieving the state-of-the-art recommendation performance. It means that CKFN can be potentially deployed into MOOCs platforms as a pivotal component to provide personalized course recommendation service.","PeriodicalId":13106,"journal":{"name":"IEEE Transactions on Big Data","volume":"10 4","pages":"457-469"},"PeriodicalIF":7.5000,"publicationDate":"2023-12-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Big Data","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10373141/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

In light of the global proliferation of the COVID-19 pandemic, there is a notable surge in public interest towards Massive Open Online Courses (MOOCs) recently. Within the realm of personalized course-learning services, large amounts of online course recommendation systems have been developed to cater to the diverse needs of learners. However, despite these advancements, there still exist three unsolved challenges: 1) how to effectively utilize the course information spanning from the title-level to the more granular keyword-level; 2) how to well capture the sequential information among learning courses; 3) how to identify the high-correlated courses in the course corpora. To address these challenges, we propose a novel solution known as C ascaded K nowledge-level F usion N etwork (CKFN) for online course recommendation with incorporating a three-fold approach to maximize the utilization of course information: 1) two knowledge graphs spanning from the keyword-level to title-level; 2) a two-stage attention fusion mechanism; 3) a novel knowledge-aware negative sampling method. Experimental results on a real dataset of XuetangX demonstrate that CKFN surpasses existing baseline models by a substantial margin, thereby achieving the state-of-the-art recommendation performance. It means that CKFN can be potentially deployed into MOOCs platforms as a pivotal component to provide personalized course recommendation service.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
用于在线课程推荐系统的级联知识层融合网络
随着 COVID-19 大流行病在全球的蔓延,公众对大规模开放式在线课程(MOOCs)的兴趣最近明显激增。在个性化课程学习服务领域,大量在线课程推荐系统应运而生,以满足学习者的不同需求。然而,尽管取得了这些进步,仍存在三个尚未解决的难题:1) 如何有效利用从标题级到更细粒度的关键字级的课程信息;2) 如何很好地捕捉学习课程之间的序列信息;3) 如何识别课程库中的高关联课程。为了应对这些挑战,我们提出了一种用于在线课程推荐的新型解决方案,即级联知识融合网络(CKFN),它从三个方面最大限度地利用了课程信息:1) 从关键词级到标题级的两个知识图谱;2) 两阶段注意力融合机制;3) 新型知识感知负抽样方法。在学堂 X 真实数据集上的实验结果表明,CKFN 大大超过了现有的基线模型,从而达到了最先进的推荐性能。这意味着CKFN有可能被部署到MOOCs平台中,成为提供个性化课程推荐服务的关键组件。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
11.80
自引率
2.80%
发文量
114
期刊介绍: The IEEE Transactions on Big Data publishes peer-reviewed articles focusing on big data. These articles present innovative research ideas and application results across disciplines, including novel theories, algorithms, and applications. Research areas cover a wide range, such as big data analytics, visualization, curation, management, semantics, infrastructure, standards, performance analysis, intelligence extraction, scientific discovery, security, privacy, and legal issues specific to big data. The journal also prioritizes applications of big data in fields generating massive datasets.
期刊最新文献
Guest Editorial TBD Special Issue on Graph Machine Learning for Recommender Systems Reliable Data Augmented Contrastive Learning for Sequential Recommendation Denoised Graph Collaborative Filtering via Neighborhood Similarity and Dynamic Thresholding Higher-Order Smoothness Enhanced Graph Collaborative Filtering AKGNN: Attribute Knowledge Graph Neural Networks Recommendation for Corporate Volunteer Activities
×
引用
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