IDVT: Interest-aware Denoising and View-guided Tuning for Social Recommendation

• URL: http://arxiv.org/abs/2308.15926v2
• Date: Mon, 17 Jun 2024 12:18:40 GMT
• Title: IDVT: Interest-aware Denoising and View-guided Tuning for Social Recommendation
• Authors: Dezhao Yang, Jianghong Ma, Shanshan Feng, Haijun Zhang, Zhao Zhang,
• Abstract summary: 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.
• Score: 25.499653256726926
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In the information age, recommendation systems are vital for efficiently filtering information and identifying user preferences. Online social platforms have enriched these systems by providing valuable auxiliary information. Socially connected users are assumed to share similar preferences, enhancing recommendation accuracy and addressing cold start issues. However, empirical findings challenge the assumption, revealing that certain social connections can actually harm system performance. Our statistical analysis indicates a significant amount of noise in the social network, where many socially connected users do not share common interests. To address this issue, we propose an innovative \underline{I}nterest-aware \underline{D}enoising and \underline{V}iew-guided \underline{T}uning (IDVT) method for the social recommendation. The first ID part effectively denoises social connections. Specifically, the denoising process considers both social network structure and user interaction interests in a global view. Moreover, in this global view, we also integrate denoised social information (social domain) into the propagation of the user-item interactions (collaborative domain) and aggregate user representations from two domains using a gating mechanism. To tackle potential user interest loss and enhance model robustness within the global view, our second VT part introduces two additional views (local view and dropout-enhanced view) for fine-tuning user representations in the global view through contrastive learning. Extensive evaluations on real-world datasets with varying noise ratios demonstrate the superiority of IDVT over state-of-the-art social recommendation methods.

Related papers

• 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)
• 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)
• Cross-Network Social User Embedding with Hybrid Differential Privacy Guarantees [81.6471440778355]
  We propose a Cross-network Social User Embedding framework, namely DP-CroSUE, to learn the comprehensive representations of users in a privacy-preserving way. In particular, for each heterogeneous social network, we first introduce a hybrid differential privacy notion to capture the variation of privacy expectations for heterogeneous data types. To further enhance user embeddings, a novel cross-network GCN embedding model is designed to transfer knowledge across networks through those aligned users.
  arXiv  Detail & Related papers  (2022-09-04T06:22:37Z)
• Federated Social Recommendation with Graph Neural Network [69.36135187771929]
  We propose fusing social information with user-item interactions to alleviate it, which is the social recommendation problem. We devise a novel framework textbfFedrated textbfSocial recommendation with textbfGraph neural network (FeSoG)
  arXiv  Detail & Related papers  (2021-11-21T09:41:39Z)
• Global Context Enhanced Social Recommendation with Hierarchical Graph Neural Networks [29.82196381724099]
  We propose a new Social Recommendation framework with Hierarchical Graph Neural Networks (SR-HGNN) In particular, we first design a relation-aware reconstructed graph neural network to inject the cross-type collaborative semantics into the recommendation framework. In addition, we further augment SR-HGNN with a social relation encoder based on the mutual information learning paradigm between low-level user embeddings and high-level global representation.
  arXiv  Detail & Related papers  (2021-10-08T11:26:04Z)
• 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 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)
• DiffNet++: A Neural Influence and Interest Diffusion Network for Social Recommendation [50.08581302050378]
  Social recommendation has emerged to leverage social connections among users for predicting users' unknown preferences. We propose a preliminary work of a neural influence diffusion network (i.e., DiffNet) for social recommendation (Diffnet) In this paper, we propose DiffNet++, an improved algorithm of Diffnet that models the neural influence diffusion and interest diffusion in a unified framework.
  arXiv  Detail & Related papers  (2020-01-15T08:45:34Z)

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.