Burger: Robust Graph Denoising-augmentation Fusion and Multi-semantic Modeling in Social Recommendation

• URL: http://arxiv.org/abs/2505.06612v2
• Date: Thu, 29 May 2025 16:52:21 GMT
• Title: Burger: Robust Graph Denoising-augmentation Fusion and Multi-semantic Modeling in Social Recommendation
• Authors: Yuqin Lan, Laurence T. Yang,
• Abstract summary: We introduce a social underlinerecommendation model with rounderlinebust gunderlineraph denoisinunderlineg-augmentation fusion and multi-sunderlineemantic Modeling(Burger)<n>Considering the different semantic information in the user-item interaction network and the social network, a bi-semantic coordination loss is proposed to model the mutual influence of semantic information.
• Score: 10.262762637015733
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In the era of rapid development of social media, social recommendation systems as hybrid recommendation systems have been widely applied. Existing methods capture interest similarity between users to filter out interest-irrelevant relations in social networks that inevitably decrease recommendation accuracy, however, limited research has a focus on the mutual influence of semantic information between the social network and the user-item interaction network for further improving social recommendation. To address these issues, we introduce a social \underline{r}ecommendation model with ro\underline{bu}st g\underline{r}aph denoisin\underline{g}-augmentation fusion and multi-s\underline{e}mantic Modeling(Burger). Specifically, we firstly propose to construct a social tensor in order to smooth the training process of the model. Then, a graph convolutional network and a tensor convolutional network are employed to capture user's item preference and social preference, respectively. Considering the different semantic information in the user-item interaction network and the social network, a bi-semantic coordination loss is proposed to model the mutual influence of semantic information. To alleviate the interference of interest-irrelevant relations on multi-semantic modeling, we further use Bayesian posterior probability to mine potential social relations to replace social noise. Finally, the sliding window mechanism is utilized to update the social tensor as the input for the next iteration. Extensive experiments on three real datasets show Burger has a superior performance compared with the state-of-the-art models.

Related papers

• DynamiX: Large-Scale Dynamic Social Network Simulator [101.65679342680542]
  DynamiX is a novel large-scale social network simulator dedicated to dynamic social network modeling.<n>For opinion leaders, we propose an information-stream-based link prediction method recommending potential users with similar stances.<n>For ordinary users, we construct an inequality-oriented behavior decision-making module.
  arXiv  Detail & Related papers  (2025-07-26T12:13:30Z)
• Invariance Matters: Empowering Social Recommendation via Graph Invariant Learning [39.957513241513105]
  Social Graph Invariant Learning (SGIL) aims to uncover stable user preferences within the input social graph.<n>To achieve this goal, SGIL first simulates multiple noisy social environments through graph generators.<n>To further promote diversity in the generated social environments, we employ an adversarial training strategy.
  arXiv  Detail & Related papers  (2025-04-14T17:20:48Z)
• Contrastive Learning Augmented Social Recommendations [9.20712944489791]
  We propose leveraging reconstructed social graph to complement interest representations derived from behavioral data.<n>Despite the widespread availability of social graphs on content platforms, their utility is hindered by social-relation noise.<n>We introduce a dual-view denoising framework to mitigate noise propagation in graph data and extract reliable social interests.
  arXiv  Detail & Related papers  (2025-01-03T16:29:51Z)
• Modeling Social Media Recommendation Impacts Using Academic Networks: A Graph Neural Network Approach [4.138915764680197]
  This study proposes to use academic social networks as a proxy for investigating recommendation systems in social media. By employing Graph Neural Networks (GNNs), we develop a model that separates the prediction of academic infosphere from behavior prediction. Our approach aims to improve our understanding of recommendation systems' roles and social networks modeling.
  arXiv  Detail & Related papers  (2024-10-06T17:03:27Z)
• 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)
• Decoding the Silent Majority: Inducing Belief Augmented Social Graph with Large Language Model for Response Forecasting [74.68371461260946]
  SocialSense is a framework that induces a belief-centered graph on top of an existent social network, along with graph-based propagation to capture social dynamics. Our method surpasses existing state-of-the-art in experimental evaluations for both zero-shot and supervised settings.
  arXiv  Detail & Related papers  (2023-10-20T06:17:02Z)
• Ordinal Graph Gamma Belief Network for Social Recommender Systems [54.9487910312535]
  We develop a hierarchical Bayesian model termed ordinal graph factor analysis (OGFA), which jointly models user-item and user-user interactions. OGFA not only achieves good recommendation performance, but also extracts interpretable latent factors corresponding to representative user preferences. We extend OGFA to ordinal graph gamma belief network, which is a multi-stochastic-layer deep probabilistic model.
  arXiv  Detail & Related papers  (2022-09-12T09:19:22Z)
• 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)
• Using Social Media Background to Improve Cold-start Recommendation Deep Models [8.444156978118087]
  We investigate whether social media background can be used as extra contextual information to improve recommendation models. Based on an existing deep neural network model, we proposed a method to represent temporal social media background as embeddings. The results show that our method of fusing social media background with the existing model does generally improve recommendation performance.
  arXiv  Detail & Related papers  (2021-06-04T04:46:29Z)
• Interpretable Signed Link Prediction with Signed Infomax Hyperbolic Graph [54.03786611989613]
  signed link prediction in social networks aims to reveal the underlying relationships (i.e. links) among users (i.e. nodes) We develop a unified framework, termed as Signed Infomax Hyperbolic Graph (textbfSIHG) In order to model high-order user relations and complex hierarchies, the node embeddings are projected and measured in a hyperbolic space with a lower distortion.
  arXiv  Detail & Related papers  (2020-11-25T05:09:03Z)
• 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.