Challenging Low Homophily in Social Recommendation
Not on the map. Why?
Abstract (arXiv)
Social relations are leveraged to tackle the sparsity issue of user-item interaction data in recommendation under the assumption of social homophily. However, social recommendation paradigms predominantly focus on homophily based on user preferences. While social information can enhance recommendations, its alignment with user preferences is not guaranteed, thereby posing the risk of introducing informational redundancy. We empirically discover that social graphs in real recommendation data exhibit low preference-aware homophily, which limits the effect of social recommendation models. To comprehensively extract preference-aware homophily information latent in the social graph, we propose Social Heterophily-alleviating Rewiring (SHaRe), a data-centric framework for enhancing existing graph-based social recommendation models. We adopt Graph Rewiring technique to capture and add highly homophilic social relations, and cut low homophilic (or heterophilic) relations. To better refine the user representations from reliable social relations, we integrate a contrastive learning method into the training of SHaRe, aiming to calibrate the user representations for enhancing the result of Graph Rewiring. Experiments on real-world datasets show that the proposed framework not only exhibits enhanced performances across varying homophily ratios but also improves the performance of existing state-of-the-art (SOTA) social recommendation models.
Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). First posted on arXiv 26 Jan 2024.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 5; 2025: 5.
10 papers.
- 2024Score-based Generative Diffusion Models for Social Recommendationscited by 23
- 2024What Is Missing In Homophily? Disentangling Graph Homophily For Graph Neural Networkscited by 9
- 2024RobGC: Towards Robust Graph Condensationcited by 8
- 2024Contrastive Graph Condensation: Advancing Data Versatility through Self-Supervised Learningcited by 6
- 2025SoREX: Towards Self-Explainable Social Recommendation with Relevant Ego-Path Extractioncited by 5
- 2024Non-Euclidean Mixture Model for Social Network Embeddingcited by 4
- 2025GGBond: Growing Graph-Based AI-Agent Society for Socially-Aware Recommender Simulationcited by 3
- 2025DARLR: Dual-Agent Offline Reinforcement Learning for Recommender Systems with Dynamic Rewardcited by 2
- 2025Norm Augmented Graph AutoEncoders for Link Predictioncited by 1
- 2025Taming Recommendation Bias with Causal Intervention on Evolving Personal Popularitycited by 0
- 2025SoREX: Towards Self-Explainable Social Recommendation with Relevant Ego-Path Extraction30 Sep 2025
- 2025GGBond: Growing Graph-Based AI-Agent Society for Socially-Aware Recommender Simulation27 May 2025
- 2025Taming Recommendation Bias with Causal Intervention on Evolving Personal Popularity20 May 2025
- 2025DARLR: Dual-Agent Offline Reinforcement Learning for Recommender Systems with Dynamic Reward12 May 2025
- 2025Norm Augmented Graph AutoEncoders for Link Prediction9 Feb 2025
- 2024Score-based Generative Diffusion Models for Social Recommendations20 Dec 2024
- 2024Contrastive Graph Condensation: Advancing Data Versatility through Self-Supervised Learning26 Nov 2024
- 2024Non-Euclidean Mixture Model for Social Network Embedding7 Nov 2024
- 2024What Is Missing In Homophily? Disentangling Graph Homophily For Graph Neural Networks27 Jun 2024
- 2024RobGC: Towards Robust Graph Condensation19 Jun 2024