SRACR: Semantic and Relationship-aware Online Course Recommendation

被引:3
|
作者
Ma, Dehua [1 ]
Wang, Yufeng [1 ]
Chen, Meijuan [1 ]
Shen, Jianhua [1 ]
机构
[1] Nanjing Univ Posts & Telecomm, Coll Telecommun & Informat Engn, Nanjing, Peoples R China
关键词
Latent Dirichlet Allocation; course knowledge graph; knowledge graph embedding method; contextual multi-armed bandit;
D O I
10.1109/TALE52509.2021.9678921
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
With the development of educational technology, more and more people are learning and gaining ability through online courses. The excessive number of courses has brought about the problem of information overload, making it necessary to recommend suitable courses for students in online interactive way. Some traditional course recommendation schemes ignore or only roughly exploit the semantics of courses, which may result in sub-optimal recommendation. Moreover, most course recommendation schemes didn't take into account the relationships between courses (e.g., two courses are taught by a teacher, etc.). To solve the above issues, this article proposes a semantic and relationship-aware online course recommendation scheme, SRACR, to recommend favorite courses for students. Specifically, Latent Dirichlet Allocation (LDA) is used to extract the fine-grained semantics of each course represented as the topic vector of the course, and then knowledge graph embedding is adopted to map the course relationships to the course knowledge vector. Then, the course feature vector is obtained through combining the course topic vector and knowledge vector. Finally, treating the feature vector of courses as context, we use a contextual multi-armed bandit-based algorithm to estimate students' preference and recommend courses to students through balancing exploration and exploitation. The experiment results on real educational dataset demonstrate the effectiveness of our proposed method.
引用
收藏
页码:367 / 374
页数:8
相关论文
共 50 条
  • [31] Effective Context-aware Recommendation on the Semantic Web
    Kim, Sungrim
    Kwon, Joonhee
    INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2007, 7 (08): : 154 - 159
  • [32] Profiling temporal learning interests with time-aware transformers and knowledge graph for online course recommendation
    Zhou, Jilei
    Jiang, Guanran
    Du, Wei
    Han, Cong
    ELECTRONIC COMMERCE RESEARCH, 2023, 23 (04) : 2357 - 2377
  • [33] Relationship-Aware Unknown Object Detection for Open-Set Scene Graph Generation
    Sonogashira, Motoharu
    Iiyama, Masaaki
    Kawanishi, Yasutomo
    IEEE ACCESS, 2024, 12 : 122513 - 122523
  • [34] Profiling temporal learning interests with time-aware transformers and knowledge graph for online course recommendation
    Jilei Zhou
    Guanran Jiang
    Wei Du
    Cong Han
    Electronic Commerce Research, 2023, 23 : 2357 - 2377
  • [35] English Online Course Development Model and Course Content Recommendation
    Wu, Ni
    MOBILE INFORMATION SYSTEMS, 2022, 2022
  • [36] Online Teaching Course Recommendation Based on Autoencoder
    Shen, Dandan
    Jiang, Zheng
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2022, 2022
  • [37] Context-aware reinforcement learning for course recommendation
    Lin, Yuanguo
    Lin, Fan
    Yang, Lvqing
    Zeng, Wenhua
    Liu, Yong
    Wu, Pengcheng
    APPLIED SOFT COMPUTING, 2022, 125
  • [38] A Relationship-Aware Feature Update Method for Enhanced Graph-Based Neural Networks
    Huang, Conggui
    IEEE Access, 2025, 13 : 37096 - 37107
  • [39] Large-scale trajectory prediction via relationship-aware adaptive hierarchical graph learning
    Hua Yan
    Yu Yang
    CCF Transactions on Pervasive Computing and Interaction, 2023, 5 : 351 - 366
  • [40] Causal Disentanglement for Semantic-Aware Intent Learning in Recommendation
    Wang, Xiangmeng
    Li, Qian
    Yu, Dianer
    Cui, Peng
    Wang, Zhichao
    Xu, Guandong
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2023, 35 (10) : 9836 - 9849