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

• URL: http://arxiv.org/abs/2402.08256v1
• Date: Tue, 13 Feb 2024 07:12:44 GMT
• Title: Modeling Balanced Explicit and Implicit Relations with Contrastive Learning for Knowledge Concept Recommendation in MOOCs
• Authors: Hengnian Gu, Zhiyi Duan, Pan Xie, Dongdai Zhou
• Abstract summary: Existing methods rely on the explicit relations between users and knowledge concepts for recommendation. There are numerous implicit relations generated within the users' learning activities on the MOOC platforms. We propose a novel framework based on contrastive learning, which can represent and balance the explicit and implicit relations.
• Score: 1.0377683220196874
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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.

Related papers

• KGIF: Optimizing Relation-Aware Recommendations with Knowledge Graph Information Fusion [16.971592142597544]
  This study introduces a specialized framework designed to merge entity and relation embeddings explicitly through a tailored self-attention mechanism. This explicit fusion enhances the interplay between user-item interactions and item-attribute relationships, providing a nuanced balance between user-centric and item-centric representations. The contributions of this work include an innovative method for explicit information fusion, improved robustness for sparse knowledge graphs, and the ability to generate explainable recommendations through interpretable path visualization.
  arXiv  Detail & Related papers  (2025-01-07T22:19:15Z)
• Enhancing Graph Contrastive Learning with Reliable and Informative Augmentation for Recommendation [84.45144851024257]
  We propose a novel framework that aims to enhance graph contrastive learning by constructing contrastive views with stronger collaborative information via discrete codes. The core idea is to map users and items into discrete codes rich in collaborative information for reliable and informative contrastive view generation.
  arXiv  Detail & Related papers  (2024-09-09T14:04:17Z)
• Semantic-Enhanced Relational Metric Learning for Recommender Systems [27.330164862413184]
  Recently, metric learning methods have been received great attention in recommendation community, which is inspired by the translation mechanism in knowledge graph. We propose a joint Semantic-Enhanced Metric Learning framework to tackle the problem in recommender systems. Specifically the semantic signal is first extracted from the target reviews containing abundant features and personalized user preferences. A novel regression model is then designed via leveraging the extracted semantic signal to improve the discriminative ability of original relation-based training process.
  arXiv  Detail & Related papers  (2024-06-07T11:54:50Z)
• SARF: Aliasing Relation Assisted Self-Supervised Learning for Few-shot Relation Reasoning [43.59319243928048]
  Few-shot relation reasoning on knowledge graphs (FS-KGR) aims to infer long-tail data-poor relations. We propose a novel Self-Supervised Learning model by leveraging Aliasing Relations to assist FS-KGR, termed SARF.
  arXiv  Detail & Related papers  (2023-04-20T13:24:59Z)
• Knowledge Relation Rank Enhanced Heterogeneous Learning Interaction Modeling for Neural Graph Forgetting Knowledge Tracing [1.0152838128195467]
  knowledge tracing models have been applied in educational data mining. Knowledge Relation Rank Enhanced Heterogeneous Learning Interaction Modeling for Neural Graph Forgetting Knowledge Tracing(NGFKT) is proposed. Experiments are conducted on the two public educational datasets and results indicate that the NGFKT model outperforms all baseline models in terms of AUC, ACC, and Performance Stability(PS)
  arXiv  Detail & Related papers  (2023-04-08T07:29:53Z)
• Intent Contrastive Learning for Sequential Recommendation [86.54439927038968]
  We introduce a latent variable to represent users' intents and learn the distribution function of the latent variable via clustering. We propose to leverage the learned intents into SR models via contrastive SSL, which maximizes the agreement between a view of sequence and its corresponding intent. Experiments conducted on four real-world datasets demonstrate the superiority of the proposed learning paradigm.
  arXiv  Detail & Related papers  (2022-02-05T09:24:13Z)
• MOOCRep: A Unified Pre-trained Embedding of MOOC Entities [4.0963355240233446]
  We propose to learn pre-trained representations of MOOC entities using abundant unlabeled data from the structure of MOOCs. Our experiments reveal that MOOCRep's embeddings outperform state-of-the-art representation learning methods on two tasks important for education community.
  arXiv  Detail & Related papers  (2021-07-12T00:11:25Z)
• Learning Intents behind Interactions with Knowledge Graph for Recommendation [93.08709357435991]
  Knowledge graph (KG) plays an increasingly important role in recommender systems. Existing GNN-based models fail to identify user-item relation at a fine-grained level of intents. We propose a new model, Knowledge Graph-based Intent Network (KGIN)
  arXiv  Detail & Related papers  (2021-02-14T03:21:36Z)
• Learning to Decouple Relations: Few-Shot Relation Classification with Entity-Guided Attention and Confusion-Aware Training [49.9995628166064]
  We propose CTEG, a model equipped with two mechanisms to learn to decouple easily-confused relations. On the one hand, an EGA mechanism is introduced to guide the attention to filter out information causing confusion. On the other hand, a Confusion-Aware Training (CAT) method is proposed to explicitly learn to distinguish relations.
  arXiv  Detail & Related papers  (2020-10-21T11:07:53Z)
• Shifu2: A Network Representation Learning Based Model for Advisor-advisee Relationship Mining [82.75996880087747]
  We propose a novel model based on Network Representation Learning (NRL), namely Shifu2. Shifu2 takes the collaboration network as input and the identified advisor-advisee relationship as output. We generate a large-scale academic genealogy dataset by taking advantage of Shifu2.
  arXiv  Detail & Related papers  (2020-08-17T05:40:06Z)
• Generative Adversarial Zero-Shot Relational Learning for Knowledge Graphs [96.73259297063619]
  We consider a novel formulation, zero-shot learning, to free this cumbersome curation. For newly-added relations, we attempt to learn their semantic features from their text descriptions. We leverage Generative Adrial Networks (GANs) to establish the connection between text and knowledge graph domain.
  arXiv  Detail & Related papers  (2020-01-08T01:19:08Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.