Graph Bottlenecked Social Recommendation

• URL: http://arxiv.org/abs/2406.08214v2
• Date: Tue, 23 Jul 2024 07:04:08 GMT
• Title: Graph Bottlenecked Social Recommendation
• Authors: Yonghui Yang, Le Wu, Zihan Wang, Zhuangzhuang He, Richang Hong, Meng Wang,
• Abstract summary: We propose a novel Graph Bottlenecked Social Recommendation (GBSR) framework to tackle the social noise issue. GBSR is a model-agnostic social denoising framework, that aims to maximize the mutual information between the denoised social graph and recommendation labels.
• Score: 47.83350026188183
• License:
• Abstract: With the emergence of social networks, social recommendation has become an essential technique for personalized services. Recently, graph-based social recommendations have shown promising results by capturing the high-order social influence. Most empirical studies of graph-based social recommendations directly take the observed social networks into formulation, and produce user preferences based on social homogeneity. Despite the effectiveness, we argue that social networks in the real-world are inevitably noisy~(existing redundant social relations), which may obstruct precise user preference characterization. Nevertheless, identifying and removing redundant social relations is challenging due to a lack of labels. In this paper, we focus on learning the denoised social structure to facilitate recommendation tasks from an information bottleneck perspective. Specifically, we propose a novel Graph Bottlenecked Social Recommendation (GBSR) framework to tackle the social noise issue.GBSR is a model-agnostic social denoising framework, that aims to maximize the mutual information between the denoised social graph and recommendation labels, meanwhile minimizing it between the denoised social graph and the original one. This enables GBSR to learn the minimal yet sufficient social structure, effectively reducing redundant social relations and enhancing social recommendations. Technically, GBSR consists of two elaborate components, preference-guided social graph refinement, and HSIC-based bottleneck learning. Extensive experimental results demonstrate the superiority of the proposed GBSR, including high performances and good generality combined with various backbones. Our code is available at: https://github.com/yimutianyang/KDD24-GBSR.

Related papers

• From a Social Cognitive Perspective: Context-aware Visual Social Relationship Recognition [59.57095498284501]
  We propose a novel approach that recognizes textbfContextual textbfSocial textbfRelationships (textbfConSoR) from a social cognitive perspective. We construct social-aware descriptive language prompts with social relationships for each image. Impressively, ConSoR outperforms previous methods with a 12.2% gain on the People-in-Social-Context (PISC) dataset and a 9.8% increase on the People-in-Photo-Album (PIPA) benchmark.
  arXiv  Detail & Related papers  (2024-06-12T16:02:28Z)
• 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)
• 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)
• 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)
• 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)
• Graph-Based Social Relation Reasoning [101.9402771161935]
  We propose a graph relational reasoning network (GR2N) for social relation recognition. Our method considers the paradigm of jointly inferring the relations by constructing a social relation graph. Experimental results illustrate that our method generates a reasonable and consistent social relation graph.
  arXiv  Detail & Related papers  (2020-07-15T03:01:11Z)
• Recursive Social Behavior Graph for Trajectory Prediction [49.005219590582676]
  We formulate social representations supervised by group-based annotations into a social behavior graph, called Recursive Social Behavior Graph. With the guidance of Recursive Social Behavior Graph, we surpass state-of-the-art method on ETH and UCY dataset for 11.1% in ADE and 10.8% in FDE.
  arXiv  Detail & Related papers  (2020-04-22T06:01:48Z)

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.