# Challenging Low Homophily in Social Recommendation

arXiv: https://arxiv.org/abs/2401.14606 · HTML: https://mlsanity.com/paper/2401.14606/

## Key facts

- Cited by 10 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 26 Jan 2024.

## Built on by (most cited first, 10 of 10)

- [Score-based Generative Diffusion Models for Social Recommendations](https://mlsanity.com/paper/2412.15579/) (2024)
- [What Is Missing In Homophily? Disentangling Graph Homophily For Graph Neural Networks](https://mlsanity.com/paper/2406.18854/) (2024)
- [RobGC: Towards Robust Graph Condensation](https://mlsanity.com/paper/2406.13200/) (2024)
- [Contrastive Graph Condensation: Advancing Data Versatility through Self-Supervised Learning](https://mlsanity.com/paper/2411.17063/) (2024)
- [SoREX: Towards Self-Explainable Social Recommendation with Relevant Ego-Path Extraction](https://mlsanity.com/paper/2510.00080/) (2025)
- [Non-Euclidean Mixture Model for Social Network Embedding](https://mlsanity.com/paper/2411.04876/) (2024)
- [GGBond: Growing Graph-Based AI-Agent Society for Socially-Aware Recommender Simulation](https://mlsanity.com/paper/2505.21154/) (2025)
- [Norm Augmented Graph AutoEncoders for Link Prediction](https://mlsanity.com/paper/2502.05868/) (2025)
- [DARLR: Dual-Agent Offline Reinforcement Learning for Recommender Systems with Dynamic Reward](https://mlsanity.com/paper/2505.07257/) (2025)
- [Taming Recommendation Bias with Causal Intervention on Evolving Personal Popularity](https://mlsanity.com/paper/2505.14310/) (2025)

## 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.