TY - JOUR
T1 - A survey on learning from graphs with heterophily
T2 - recent advances and future directions
AU - Gong, Cheng Hua
AU - Cheng, Yao
AU - Yu, Jian Xiang
AU - Xu, Can
AU - Shan, Cai Hua
AU - Luo, Si Qiang
AU - Li, Xiang
N1 - Publisher Copyright:
© The Author(s) 2025.
PY - 2026/2
Y1 - 2026/2
N2 - Graphs are structured data that models complex relations between real-world entities. Heterophilic graphs, where linked nodes trend to have different labels or dissimilar features, have recently attracted significant attention and found many real-world applications. Meanwhile, increasing efforts have been made to advance learning from graphs with heterophily. Various graph heterophily measures, benchmark datasets, and learning paradigms are emerging rapidly. In this survey, we comprehensively review existing works on learning from graphs with heterophily. First, we overview over 500 publications, of which more than 300 are directly related to heterophilic graphs. After that, we survey existing metrics of graph heterophily and list recent benchmark datasets. Further, we systematically categorize existing methods based on a hierarchical taxonomy including GNN models, learning paradigms and practical applications. In addition, broader topics related to graph heterophily are also included. Finally, we discuss the primary challenges of existing studies and highlight promising avenues for future research.
AB - Graphs are structured data that models complex relations between real-world entities. Heterophilic graphs, where linked nodes trend to have different labels or dissimilar features, have recently attracted significant attention and found many real-world applications. Meanwhile, increasing efforts have been made to advance learning from graphs with heterophily. Various graph heterophily measures, benchmark datasets, and learning paradigms are emerging rapidly. In this survey, we comprehensively review existing works on learning from graphs with heterophily. First, we overview over 500 publications, of which more than 300 are directly related to heterophilic graphs. After that, we survey existing metrics of graph heterophily and list recent benchmark datasets. Further, we systematically categorize existing methods based on a hierarchical taxonomy including GNN models, learning paradigms and practical applications. In addition, broader topics related to graph heterophily are also included. Finally, we discuss the primary challenges of existing studies and highlight promising avenues for future research.
KW - graph learning
KW - graph neural networks
KW - graphs with heterophily
KW - heterophilic graphs
UR - https://www.scopus.com/pages/publications/105019189633
U2 - 10.1007/s11704-025-41059-z
DO - 10.1007/s11704-025-41059-z
M3 - 文献综述
AN - SCOPUS:105019189633
SN - 2095-2228
VL - 20
JO - Frontiers of Computer Science
JF - Frontiers of Computer Science
IS - 2
M1 - 2002314
ER -