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 条
  • [1] KGCF: Social relationship-aware graph collaborative filtering for recommendation
    Chen, Yunliang
    Xie, Tianyu
    Chen, Haofeng
    Huang, Xiaohui
    Cui, Ningning
    Li, Jianxin
    INFORMATION SCIENCES, 2024, 680
  • [2] A Social Relationship-aware Mobility Model
    Dat Van Anh Duong
    Yoon, Seokhoon
    2018 IEEE 4TH WORLD FORUM ON INTERNET OF THINGS (WF-IOT), 2018, : 658 - 663
  • [3] Learning Relationship-Aware Visual Features
    Messina, Nicola
    Amato, Giuseppe
    Carrara, Fabio
    Falchi, Fabrizio
    Gennaro, Claudio
    COMPUTER VISION - ECCV 2018 WORKSHOPS, PT IV, 2019, 11132 : 486 - 501
  • [4] Object affordance detection with relationship-aware network
    Zhao, Xue
    Cao, Yang
    Kang, Yu
    NEURAL COMPUTING & APPLICATIONS, 2020, 32 (18): : 14321 - 14333
  • [5] A relationship-aware methodology for context-aware service selection
    Kwon, Ohbyung
    Lee, Namyeon
    EXPERT SYSTEMS, 2011, 28 (04) : 375 - 390
  • [6] Relationship-aware contrastive learning for social recommendations
    Ji, Jinchao
    Zhang, Bingjie
    Yu, Junchao
    Zhang, Xudong
    Qiu, Dinghang
    Zhang, Bangzuo
    INFORMATION SCIENCES, 2023, 629 : 778 - 797
  • [7] Object affordance detection with relationship-aware network
    Xue Zhao
    Yang Cao
    Yu Kang
    Neural Computing and Applications, 2020, 32 : 14321 - 14333
  • [8] Joint Topic-Semantic-aware Social Recommendation for Online Voting
    Wang, Hongwei
    Wang, Jia
    Zhao, Miao
    Cao, Jiannong
    Guo, Minyi
    CIKM'17: PROCEEDINGS OF THE 2017 ACM CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT, 2017, : 347 - 356
  • [9] SRMM: A Social Relationship-Aware Human Mobility Model
    Duong, Dat Van Anh
    Yoon, Seokhoon
    ELECTRONICS, 2020, 9 (02)
  • [10] RAQ: Relationship-Aware Graph Querying in Large Networks
    Vachery, Jithin
    Arora, Akhil
    Ranu, Sayan
    Bhattacharya, Arnab
    WEB CONFERENCE 2019: PROCEEDINGS OF THE WORLD WIDE WEB CONFERENCE (WWW 2019), 2019, : 1886 - 1896