Recognition: unknown
Graph Neural Networks for Graphs with Heterophily: A Survey
read the original abstract
Recent years have witnessed fast developments of graph neural networks (GNNs) that have benefited myriad graph analytic tasks and applications. Most GNNs rely on the homophily assumption that nodes belonging to the same class are more likely to be connected. However, as a ubiquitous graph property in numerous real-world scenarios, heterophily, i.e., nodes with different labels tend to be linked, significantly limits the performance of tailor-made homophilic GNNs. Hence, GNNs for heterophilic graphs are gaining increasing research attention to enhance graph learning with heterophily. In this paper, we provide a comprehensive review of GNNs for heterophilic graphs. Specifically, we propose a systematic taxonomy that governs existing heterophilic GNN models, along with general summaries and detailed analyses. Furthermore, we discuss the relationship between heterophily and various graph research domains, aiming to facilitate the development of more effective GNNs across a spectrum of practical applications and learning tasks in the graph research community. In the end, we point out potential directions to advance and inspire future research and applications on heterophilic graph learning with GNNs.
This paper has not been read by Pith yet.
Forward citations
Cited by 6 Pith papers
-
Neighbourhood Transformer: Switchable Attention for Monophily-Aware Graph Learning
Neighbourhood Transformers apply local self-attention for monophily-aware graph learning, guarantee expressiveness at least as strong as message-passing GNNs, and outperform prior methods on node classification across...
-
Modeling Heterophily in Multiplex Graphs: An Adaptive Approach for Node Classification
A new method for node classification in multiplex graphs adapts to mixed homophily and heterophily per dimension via compatibility matrices and Chebyshev-approximated product filters optimized with proximal gradients.
-
Debiased Multimodal Personality Understanding through Dual Causal Intervention
DCAN uses dual causal adjustments with prototype and mediator dictionaries to debias multimodal personality understanding, reporting higher accuracy and fairness on CFI-V2 and a new DMSP dataset.
-
HeterSEED: Semantics-Structure Decoupling for Heterogeneous Graph Learning under Heterophily
HeterSEED decouples semantics from structure in heterogeneous graphs under heterophily using separate channels and adaptive fusion, proving higher expressiveness and lower bias than standard HGNNs while outperforming ...
-
Attention-based graph neural networks: a survey
The survey groups attention-based GNNs into three stages—graph recurrent attention networks, graph attention networks, and graph transformers—while reviewing architectures and future directions.
-
Graph Rewiring in GNNs to Mitigate Over-Squashing and Over-Smoothing: A Survey
A survey reviewing graph rewiring methods that modify topology to mitigate over-squashing and over-smoothing in GNNs.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.