mlsanityData to 7 Oct 2026

Modeling Balanced Explicit and Implicit Relations with Contrastive Learning for Knowledge Concept Recommendation in MOOCs

arXiv 2402.08256 ↗First posted 13 Feb 2024cs.IR cs.AIcited by 1

Not on the map. Why?

Abstract (arXiv)

The knowledge concept recommendation in Massive Open Online Courses (MOOCs) is a significant issue that has garnered widespread attention. Existing methods primarily rely on the explicit relations between users and knowledge concepts on the MOOC platforms for recommendation. However, there are numerous implicit relations (e.g., shared interests or same knowledge levels between users) generated within the users' learning activities on the MOOC platforms. Existing methods fail to consider these implicit relations, and these relations themselves are difficult to learn and represent, causing poor performance in knowledge concept recommendation and an inability to meet users' personalized needs. To address this issue, we propose a novel framework based on contrastive learning, which can represent and balance the explicit and implicit relations for knowledge concept recommendation in MOOCs (CL-KCRec). Specifically, we first construct a MOOCs heterogeneous information network (HIN) by modeling the data from the MOOC platforms. Then, we utilize a relation-updated graph convolutional network and stacked multi-channel graph neural network to represent the explicit and implicit relations in the HIN, respectively. Considering that the quantity of explicit relations is relatively fewer compared to implicit relations in MOOCs, we propose a contrastive learning with prototypical graph to enhance the representations of both relations to capture their fruitful inherent relational knowledge, which can guide the propagation of students' preferences within the HIN. Based on these enhanced representations, to ensure the balanced contribution of both towards the final recommendation, we propose a dual-head attention mechanism for balanced fusion. Experimental results demonstrate that CL-KCRec outperforms several state-of-the-art baselines on real-world datasets in terms of HR, NDCG and MRR.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 22 of its 40 references that are in the map. First posted on arXiv 13 Feb 2024.

Builds on

22 of 40 references.

References · 22

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  2. 2017Graph Attention Networkscited by 8,854
  3. 2017Modeling Relational Data with Graph Convolutional Networkscited by 1,684
  4. 2017Neural Collaborative Filteringcited by 1,108
  5. 2019Neural Graph Collaborative Filteringcited by 660
  6. 2020Prototypical Contrastive Learning of Unsupervised Representationscited by 636
  7. 2019Graph Transformer Networkscited by 520
  8. 2019Composition-based Multi-Relational Graph Convolutional Networkscited by 395
  9. 2020Self-supervised Graph Learning for Recommendationcited by 305
  10. 2020Disentangled and Controllable Face Image Generation via 3D Imitative-Contrastive Learningcited by 219
  11. 2015Holographic Embeddings of Knowledge Graphscited by 181
  12. 2018A2-Nets: Double Attention Networkscited by 136
10 more
  1. 2017Heterogeneous Information Network Embedding for Recommendationcited by 133
  2. 2021Self-Supervised Multi-Channel Hypergraph Convolutional Network for Social Recommendationcited by 101
  3. 2022Knowledge Graph Contrastive Learning for Recommendationcited by 69
  4. 2018NAIS: Neural Attentive Item Similarity Model for Recommendationcited by 52
  5. 2022Contrastive Meta Learning with Behavior Multiplicity for Recommendationcited by 37
  6. 2020Attentional Graph Convolutional Networks for Knowledge Concept Recommendation in MOOCs in a Heterogeneous Viewcited by 30
  7. 2023Heterogeneous Graph Contrastive Learning for Recommendationcited by 28
  8. 2020LRC-BERT: Latent-representation Contrastive Knowledge Distillation for Natural Language Understandingcited by 27
  9. 2021Graph Transformer Networks: Learning Meta-path Graphs to Improve GNNscited by 22
  10. 2021Social Recommendation with Self-Supervised Metagraph Informax Networkcited by 18

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.