.png){kind=icon}
Return
Generalized heterophily graph data augmentation for node classification
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neunet.2023.09.021.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Graph data augmentations have demonstrated remarkable performance on homophilic graph neural networks (GNNs). Nevertheless, when transferred to a heterophilic graph, these augmentations are less effective for GNN models and lead to reduced performance. To address this issue, we propose a unified augmentation approach called GePHo, a regularization technique for heterophilic graph neural networks based on self-supervised learning, leveraging graph data augmentation to acquire extra information to guide model learning. Specifically, we propose to generate a pseudo-homophily graph that is type-agnostic, enabling us to apply GePHo to both homophilic and heterophilic graphs. Then, we regularize the neighbors with a sharpening technique for data augmentation and generate the auxiliary pseudo-labels to classify the original GNN's output, whose operations are to constrain the local and global node representation, respectively. Extensive experiments on three homophilic graph and six heterophilic graph datasets demonstrate the competitive effectiveness of GePHo in node classification task, and the ablation experiments verify the efficacy of our GePHo in graph data augmentation.(c) 2023 Elsevier Ltd. All rights reserved.
Keywords:
Heterophily
Graph data augmentation
Self-supervised
Journal
IF:
6.3
Papers:
8.3K
Citations:
3.0W
Organization
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveShareSaveShareSave
ShareSaveShareSaveShareSave
View more