Improving Content Recommendation: Knowledge Graph-Based Semantic Contrastive Learning for Diversity and Cold-Start Users

• URL: http://arxiv.org/abs/2403.18667v1
• Date: Wed, 27 Mar 2024 15:11:00 GMT
• Title: Improving Content Recommendation: Knowledge Graph-Based Semantic Contrastive Learning for Diversity and Cold-Start Users
• Authors: Yejin Kim, Scott Rome, Kevin Foley, Mayur Nankani, Rimon Melamed, Javier Morales, Abhay Yadav, Maria Peifer, Sardar Hamidian, H. Howie Huang,
• Abstract summary: We propose a hybrid multi-task learning approach, training on user-item and item-item interactions. Our approach allows the model to better understand the relationships between entities within the knowledge graph by utilizing semantic information from text.
• Score: 5.224122150536595
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Addressing the challenges related to data sparsity, cold-start problems, and diversity in recommendation systems is both crucial and demanding. Many current solutions leverage knowledge graphs to tackle these issues by combining both item-based and user-item collaborative signals. A common trend in these approaches focuses on improving ranking performance at the cost of escalating model complexity, reducing diversity, and complicating the task. It is essential to provide recommendations that are both personalized and diverse, rather than solely relying on achieving high rank-based performance, such as Click-through Rate, Recall, etc. In this paper, we propose a hybrid multi-task learning approach, training on user-item and item-item interactions. We apply item-based contrastive learning on descriptive text, sampling positive and negative pairs based on item metadata. Our approach allows the model to better understand the relationships between entities within the knowledge graph by utilizing semantic information from text. It leads to more accurate, relevant, and diverse user recommendations and a benefit that extends even to cold-start users who have few interactions with items. We perform extensive experiments on two widely used datasets to validate the effectiveness of our approach. Our findings demonstrate that jointly training user-item interactions and item-based signals using synopsis text is highly effective. Furthermore, our results provide evidence that item-based contrastive learning enhances the quality of entity embeddings, as indicated by metrics such as uniformity and alignment.

Related papers

• Enhancing Graph Contrastive Learning with Reliable and Informative Augmentation for Recommendation [84.45144851024257]
  CoGCL aims to enhance graph contrastive learning by constructing contrastive views with stronger collaborative information via discrete codes. We introduce a multi-level vector quantizer in an end-to-end manner to quantize user and item representations into discrete codes. For neighborhood structure, we propose virtual neighbor augmentation by treating discrete codes as virtual neighbors. Regarding semantic relevance, we identify similar users/items based on shared discrete codes and interaction targets to generate the semantically relevant view.
  arXiv  Detail & Related papers  (2024-09-09T14:04:17Z)
• Retrieval Augmentation via User Interest Clustering [57.63883506013693]
  Industrial recommender systems are sensitive to the patterns of user-item engagement. We propose a novel approach that efficiently constructs user interest and facilitates low computational cost inference. Our approach has been deployed in multiple products at Meta, facilitating short-form video related recommendation.
  arXiv  Detail & Related papers  (2024-08-07T16:35:10Z)
• 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)
• Improving One-class Recommendation with Multi-tasking on Various Preference Intensities [1.8416014644193064]
  In one-class recommendation, it's required to make recommendations based on users' implicit feedback. We propose a multi-tasking framework taking various preference intensities of each signal from implicit feedback into consideration. Our method performs better than state-of-the-art methods by a large margin on three large-scale real-world benchmark datasets.
  arXiv  Detail & Related papers  (2024-01-18T18:59:55Z)
• Visual Commonsense based Heterogeneous Graph Contrastive Learning [79.22206720896664]
  We propose a heterogeneous graph contrastive learning method to better finish the visual reasoning task. Our method is designed as a plug-and-play way, so that it can be quickly and easily combined with a wide range of representative methods.
  arXiv  Detail & Related papers  (2023-11-11T12:01:18Z)
• Intent-aware Multi-source Contrastive Alignment for Tag-enhanced Recommendation [46.04494053005958]
  We seek an alternative framework that is light and effective through self-supervised learning across different sources of information. We use a self-supervision signal to pair users with the auxiliary information associated with the items they have interacted with before. We show that our method can achieve better performance while requiring less training time.
  arXiv  Detail & Related papers  (2022-11-11T17:43:19Z)
• Adapting Triplet Importance of Implicit Feedback for Personalized Recommendation [43.85549591503592]
  Implicit feedback is frequently used for developing personalized recommendation services. We propose a novel training framework named Triplet Importance Learning (TIL), which adaptively learns the importance score of training triplets. We show that our proposed method outperforms the best existing models by 3-21% in terms of Recall@k for the top-k recommendation.
  arXiv  Detail & Related papers  (2022-08-02T19:44:47Z)
• Learning to Match Jobs with Resumes from Sparse Interaction Data using Multi-View Co-Teaching Network [83.64416937454801]
  Job-resume interaction data is sparse and noisy, which affects the performance of job-resume match algorithms. We propose a novel multi-view co-teaching network from sparse interaction data for job-resume matching. Our model is able to outperform state-of-the-art methods for job-resume matching.
  arXiv  Detail & Related papers  (2020-09-25T03:09:54Z)
• Mining Implicit Entity Preference from User-Item Interaction Data for Knowledge Graph Completion via Adversarial Learning [82.46332224556257]
  We propose a novel adversarial learning approach by leveraging user interaction data for the Knowledge Graph Completion task. Our generator is isolated from user interaction data, and serves to improve the performance of the discriminator. To discover implicit entity preference of users, we design an elaborate collaborative learning algorithms based on graph neural networks.
  arXiv  Detail & Related papers  (2020-03-28T05:47:33Z)

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.