Guess you like: course recommendation in MOOCs

Xia Jing, Jie Tang
{"title":"Guess you like: course recommendation in MOOCs","authors":"Xia Jing, Jie Tang","doi":"10.1145/3106426.3106478","DOIUrl":null,"url":null,"abstract":"Recommending courses to online students is a fundamental and also challenging issue in MOOCs. Not exactly like recommendation in traditional online systems, students who enrolled the same course may have very different purposes and with very different backgrounds. For example, one may want to study \"data mining\" after studying the course of \"big data analytics\" because the former is a prerequisite course of the latter, while some other may choose \"data mining\" simply because of curiosity. Employing the complete data from XuetangX1, one of the largest MOOCs in China, we conduct a systematic investigation on the problem of student behavior modeling for course recommendation. We design a content-aware algorithm framework using content based users' access behaviors to extract user-specific latent information to represent students' interest profile. We also leverage the demographics and course prerequisite relation to better reveal users' potential choice. Finally, we develop a course recommendation algorithm based on the user interest, demographic profiles and course prerequisite relation using collaborative filtering strategy. Experiment results demonstrate that the proposed algorithm performs much better than several baselines (over 2X by MRR). We have deployed the recommendation algorithm onto the platform XuetangX as a new feature, which significantly helps improve the course recommendation performance (+24.6% by click rate) comparing with the recommendation strategy previously used in the system.","PeriodicalId":20685,"journal":{"name":"Proceedings of the 7th International Conference on Web Intelligence, Mining and Semantics","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2017-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"65","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 7th International Conference on Web Intelligence, Mining and Semantics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3106426.3106478","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 65

Abstract

Recommending courses to online students is a fundamental and also challenging issue in MOOCs. Not exactly like recommendation in traditional online systems, students who enrolled the same course may have very different purposes and with very different backgrounds. For example, one may want to study "data mining" after studying the course of "big data analytics" because the former is a prerequisite course of the latter, while some other may choose "data mining" simply because of curiosity. Employing the complete data from XuetangX1, one of the largest MOOCs in China, we conduct a systematic investigation on the problem of student behavior modeling for course recommendation. We design a content-aware algorithm framework using content based users' access behaviors to extract user-specific latent information to represent students' interest profile. We also leverage the demographics and course prerequisite relation to better reveal users' potential choice. Finally, we develop a course recommendation algorithm based on the user interest, demographic profiles and course prerequisite relation using collaborative filtering strategy. Experiment results demonstrate that the proposed algorithm performs much better than several baselines (over 2X by MRR). We have deployed the recommendation algorithm onto the platform XuetangX as a new feature, which significantly helps improve the course recommendation performance (+24.6% by click rate) comparing with the recommendation strategy previously used in the system.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
我猜你喜欢:mooc课程推荐
向在线学生推荐课程是mooc的一个基本问题,也是一个具有挑战性的问题。与传统的在线推荐系统不完全一样,选修同一门课程的学生可能有非常不同的目的和背景。例如,有人可能在学习了“大数据分析”课程后,又想学习“数据挖掘”,因为前者是后者的必修课程,而另一些人可能只是出于好奇而选择“数据挖掘”。我们利用国内最大的mooc之一学堂x1的完整数据,对学生行为建模在课程推荐中的问题进行了系统的研究。我们设计了一个内容感知算法框架,利用基于内容的用户访问行为来提取用户特定的潜在信息来代表学生的兴趣概况。我们还利用人口统计和课程先决条件的关系来更好地揭示用户的潜在选择。最后,采用协同过滤策略,基于用户兴趣、人口统计资料和课程先决条件关系,开发了一种课程推荐算法。实验结果表明,该算法的性能优于几种基准(MRR大于2X)。我们将推荐算法作为一个新特性部署到XuetangX平台上,与系统之前使用的推荐策略相比,显著提高了课程推荐性能(点击率+24.6%)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
WIMS 2020: The 10th International Conference on Web Intelligence, Mining and Semantics, Biarritz, France, June 30 - July 3, 2020 A deep learning approach for web service interactions Partial sums-based P-Rank computation in information networks Mining ordinal data under human response uncertainty Haste makes waste: a case to favour voting bots
×
引用
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