IDVT: Interest-aware Denoising and View-guided Tuning for Social Recommendation
Not on the map. Why?
Abstract (arXiv)
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 underlineInterest-aware underlineDenoising and underlineView-guided underlineTuning (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.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 22 of its 40 references that are in the map. First posted on arXiv 30 Aug 2023.
Builds on
22 of 40 references.
References · 22
- 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,139
- 2019Graph Neural Networks for Social Recommendationcited by 714
- 2019Neural Graph Collaborative Filteringcited by 661
- 2020Self-supervised Graph Learning for Recommendationcited by 305
- 2021Are Graph Augmentations Necessary? Simple Graph Contrastive Learning for Recommendationcited by 173
- 2020Disentangled Graph Collaborative Filteringcited by 118
- 2021Self-Supervised Multi-Channel Hypergraph Convolutional Network for Social Recommendationcited by 101
- 2022Self-Supervised Learning for Recommender Systems: A Surveycited by 95
- 2022Improving Graph Collaborative Filtering with Neighborhood-enriched Contrastive Learningcited by 86
- 2023LightGCL: Simple Yet Effective Graph Contrastive Learning for Recommendationcited by 72
- 2019A Neural Influence Diffusion Model for Social Recommendationcited by 70
- 2022A Survey of Graph Neural Networks for Social Recommender Systemscited by 65
10 more
- 2020DiffNet++: A Neural Influence and Interest Diffusion Network for Social Recommendationcited by 46
- 2021Socially-Aware Self-Supervised Tri-Training for Recommendationcited by 32
- 2022Multi-level Cross-view Contrastive Learning for Knowledge-aware Recommender Systemcited by 30
- 2022Disentangled Contrastive Learning for Social Recommendationcited by 27
- 2022Multi-view Intent Disentangle Graph Networks for Bundle Recommendationcited by 22
- 2016A Generic Coordinate Descent Framework for Learning from Implicit Feedbackcited by 16
- 2020Enhancing Social Recommendation with Adversarial Graph Convolutional Networkscited by 16
- 2022Large-scale Personalized Video Game Recommendation via Social-aware Contextualized Graph Neural Networkcited by 14
- 2023Denoised Self-Augmented Learning for Social Recommendationcited by 8
- 2021Dual Side Deep Context-aware Modulation for Social Recommendationcited by 5
Built on by
Citing papers per year: 2025: 1.
1 paper.