Heterophily‐Aware Motif‐Guided Contrastive Learning for Robust Social Recommendation

ABSTRACT The homophily principle serves as the core foundation of graph neural network (GNN) based social recommendation, which assumes socially connected users share similar preferences and enables neighbourhood aggregation for user representation learning. Most existing methods directly aggregate information from original social graphs, but this strategy is severely suboptimal due to the prevalent low preference‐aware homophily in real‐world social networks. We further reveal that nonpreference‐driven social connections introduce massive noise into GNN aggregation, leading to representation degradation, over‐smoothing and even performance decline. Existing efforts mostly focus on individual subproblems of social denoising, high‐order modelling or representation enhancement and fail to provide a systematic solution for these cascading challenges. In this paper, we propose H2Rec, a heterophily‐aware motif‐guided contrastive learning framework for low‐homophily social recommendation. It integrates a dual‐branch social aggregation module, a homophily‐enhanced contrastive alignment objective and a user‐adaptive fusion mechanism to suppress noise and learn robust user representations end‐to‐end. Extensive experiments on real‐world benchmarks show that H2Rec significantly outperforms state‐of‐the‐art methods on mainstream evaluation metrics.

Authors

Institutions

Publication Details

Journal
Expert Systems
Published
2026-10-16
DOI
https://doi.org/10.1111/exsy.70457
Primary Topic
Recommender Systems and Techniques
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Heterophily‐Aware Motif‐Guided Contrastive Learning for Robust Social Recommendation

Chulei Xiang, Yuan-Kun Xu, Yinghe Wang
Expert Systems
Recommender Systems and Techniques
article

Heterophily‐Aware Motif‐Guided Contrastive Learning for Robust Social Recommendation

Chulei Xiang, Yuan-Kun Xu, Yinghe Wang
article en

Abstract

ABSTRACT The homophily principle serves as the core foundation of graph neural network (GNN) based social recommendation, which assumes socially connected users share similar preferences and enables neighbourhood aggregation for user representation learning. Most existing methods directly aggregate information from original social graphs, but this strategy is severely suboptimal due to the prevalent low preference‐aware homophily in real‐world social networks. We further reveal that nonpreference‐driven social connections introduce massive noise into GNN aggregation, leading to representation degradation, over‐smoothing and even performance decline. Existing efforts mostly focus on individual subproblems of social denoising, high‐order modelling or representation enhancement and fail to provide a systematic solution for these cascading challenges. In this paper, we propose H2Rec, a heterophily‐aware motif‐guided contrastive learning framework for low‐homophily social recommendation. It integrates a dual‐branch social aggregation module, a homophily‐enhanced contrastive alignment objective and a user‐adaptive fusion mechanism to suppress noise and learn robust user representations end‐to‐end. Extensive experiments on real‐world benchmarks show that H2Rec significantly outperforms state‐of‐the‐art methods on mainstream evaluation metrics.

Expert SystemsVol. 43(12)
Anhui University (CN), Hefei University of Technology (CN), Tongling University (CN)
Anhui Provincial Department of Education
Openalex Percentile: Top 6%
Recommender Systems and Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.