.png){kind=icon}
.png){kind=icon}
Return
Simplified PCNet with robustness
.png){kind=icon}
OA
AI
DOI：10.1016/j.neunet.2024.107099.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Graph Neural Networks (GNNs) have garnered significant attention for their success in learning the representation of homophilic or heterophilic graphs. However, they cannot generalize well to real-world graphs with different levels of homophily. In response, the Poisson-Charlier Network (PCNet) (Li et al., 2024), the previous work, allows graph representation to be learned from heterophily to homophily. Although PCNet alleviates the heterophily issue, there remain some challenges in further improving the efficacy and efficiency. In this paper, we simplify PCNet and enhance its robustness. We first extend the filter order to continuous values and reduce its parameters. Two variants with adaptive neighborhood sizes are implemented. Theoretical analysis shows our model's robustness to graph structure perturbations or adversarial attacks. We validate our approach through semi-supervised learning tasks on various datasets representing both homophilic and heterophilic graphs. The code has been released in https://github.com/uestclbh/SPC-Net.
Keywords:
Graph filtering
Heterophily
Polynomial approximation
Adversarial attack
Spectral method
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.3
Papers:
7.8K
Citations:
3.0W