Graph Neural Networks for Graphs with Heterophily: A Survey

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Zheng, Xin, Wang, Yi, Liu, Yixin, Li, Ming, Zhang, Miao, Jin, Di, Yu, Philip S., Pan, Shirui
Format: Preprint
Published: 2022
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866910140405383168
author Zheng, Xin
Wang, Yi
Liu, Yixin
Li, Ming
Zhang, Miao
Jin, Di
Yu, Philip S.
Pan, Shirui
author_facet Zheng, Xin
Wang, Yi
Liu, Yixin
Li, Ming
Zhang, Miao
Jin, Di
Yu, Philip S.
Pan, Shirui
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2202_07082
institution arXiv
publishDate 2022
record_format arxiv
spellingShingle Graph Neural Networks for Graphs with Heterophily: A Survey
Zheng, Xin
Wang, Yi
Liu, Yixin
Li, Ming
Zhang, Miao
Jin, Di
Yu, Philip S.
Pan, Shirui
Machine Learning
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.
title Graph Neural Networks for Graphs with Heterophily: A Survey
topic Machine Learning
url https://arxiv.org/abs/2202.07082