Disentangled Contrastive Learning for Social Recommendation

• URL: http://arxiv.org/abs/2208.08723v2
• Date: Tue, 3 Oct 2023 05:21:38 GMT
• Title: Disentangled Contrastive Learning for Social Recommendation
• Authors: Jiahao Wu, Wenqi Fan, Jingfan Chen, Shengcai Liu, Qing Li, Ke Tang
• Abstract summary: Social recommendations utilize social relations to enhance the representation learning for recommendations. We propose a novel Disentangled contrastive learning framework for social Recommendations DcRec.
• Score: 28.606016662435117
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Social recommendations utilize social relations to enhance the representation learning for recommendations. Most social recommendation models unify user representations for the user-item interactions (collaborative domain) and social relations (social domain). However, such an approach may fail to model the users heterogeneous behavior patterns in two domains, impairing the expressiveness of user representations. In this work, to address such limitation, we propose a novel Disentangled contrastive learning framework for social Recommendations DcRec. More specifically, we propose to learn disentangled users representations from the item and social domains. Moreover, disentangled contrastive learning is designed to perform knowledge transfer between disentangled users representations for social recommendations. Comprehensive experiments on various real-world datasets demonstrate the superiority of our proposed model.

Related papers

• RecDiff: Diffusion Model for Social Recommendation [14.514770044236375]
  We propose a novel diffusion-based social denoising framework for recommendation (RecDiff) By performing multi-step noise diffusion and removal, RecDiff possesses a robust ability to identify and eliminate noise from encoded user representations. The results demonstrate its superiority in terms of recommendation accuracy, training efficiency, and denoising effectiveness.
  arXiv  Detail & Related papers  (2024-06-01T10:20:52Z)
• Balancing User Preferences by Social Networks: A Condition-Guided Social Recommendation Model for Mitigating Popularity Bias [64.73474454254105]
  Social recommendation models weave social interactions into their design to provide uniquely personalized recommendation results for users. Existing social recommendation models fail to address the issues of popularity bias and the redundancy of social information. We propose a Condition-Guided Social Recommendation Model (named CGSoRec) to mitigate the model's popularity bias.
  arXiv  Detail & Related papers  (2024-05-27T02:45:01Z)
• Learning Social Graph for Inactive User Recommendation [50.090904659803854]
  LSIR learns an optimal social graph structure for social recommendation, especially for inactive users. Experiments on real-world datasets demonstrate that LSIR achieves significant improvements of up to 129.58% on NDCG in inactive user recommendation.
  arXiv  Detail & Related papers  (2024-05-08T03:40:36Z)
• Representation Learning with Large Language Models for Recommendation [34.46344639742642]
  We propose a model-agnostic framework RLMRec to enhance recommenders with large language models (LLMs)empowered representation learning. RLMRec incorporates auxiliary textual signals, develops a user/item profiling paradigm empowered by LLMs, and aligns the semantic space of LLMs with the representation space of collaborative relational signals.
  arXiv  Detail & Related papers  (2023-10-24T15:51:13Z)
• IDVT: Interest-aware Denoising and View-guided Tuning for Social Recommendation [25.499653256726926]
  Socially connected users are assumed to share similar preferences, enhancing recommendation accuracy and addressing cold start issues. Our statistical analysis indicates a significant amount of noise in the social network, where many socially connected users do not share common interests. We propose an innovative underlineInterest-aware underlineDenoising and underlineView-guided underlineTuning (IDVT) method for the social recommendation.
  arXiv  Detail & Related papers  (2023-08-30T10:03:55Z)
• Latent User Intent Modeling for Sequential Recommenders [92.66888409973495]
  Sequential recommender models learn to predict the next items a user is likely to interact with based on his/her interaction history on the platform. Most sequential recommenders however lack a higher-level understanding of user intents, which often drive user behaviors online. Intent modeling is thus critical for understanding users and optimizing long-term user experience.
  arXiv  Detail & Related papers  (2022-11-17T19:00:24Z)
• 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)
• Propagation-aware Social Recommendation by Transfer Learning [0.0]
  We propose a novel Transfer Learning Network based on the propagation of social relations. We explore social influence in two aspects: (a) higher-order friends have been taken into consideration by order bias; (b) different friends in the same order will have distinct importance for recommendation by an attention mechanism.
  arXiv  Detail & Related papers  (2021-07-10T14:21:27Z)
• Dual Metric Learning for Effective and Efficient Cross-Domain Recommendations [85.6250759280292]
  Cross domain recommender systems have been increasingly valuable for helping consumers identify useful items in different applications. Existing cross-domain models typically require large number of overlap users, which can be difficult to obtain in some applications. We propose a novel cross-domain recommendation model based on dual learning that transfers information between two related domains in an iterative manner.
  arXiv  Detail & Related papers  (2021-04-17T09:18:59Z)
• Dual Side Deep Context-aware Modulation for Social Recommendation [50.59008227281762]
  We propose a novel graph neural network to model the social relation and collaborative relation. On top of high-order relations, a dual side deep context-aware modulation is introduced to capture the friends' information and item attraction.
  arXiv  Detail & Related papers  (2021-03-16T11:08:30Z)
• HSR: Hyperbolic Social Recommender [3.788467660629549]
  We present Hyperbolic Social Recommender (HSR), a novel social recommendation framework that utilizes hyperbolic geometry to boost the performance. HSR can learn high-quality user and item representations for better modeling user-item interaction and user-user social relations. We show that our proposed HSR outperforms its Euclidean counterpart and state-of-the-art social recommenders in click-through rate prediction and top-K recommendation.
  arXiv  Detail & Related papers  (2021-02-15T12:09:46Z)

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.