Saved in:
| Main Authors: | , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2408.00700 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916343040704512 |
|---|---|
| author | Yang, Tianmeng Meng, Jiahao Zhou, Min Yang, Yaming Wang, Yujing Li, Xiangtai Tong, Yunhai |
| author_facet | Yang, Tianmeng Meng, Jiahao Zhou, Min Yang, Yaming Wang, Yujing Li, Xiangtai Tong, Yunhai |
| contents | Recent research on the robustness of Graph Neural Networks (GNNs) under noises or attacks has attracted great attention due to its importance in real-world applications. Most previous methods explore a single noise source, recovering corrupt node embedding by reliable structures bias or developing structure learning with reliable node features. However, the noises and attacks may come from both structures and features in graphs, making the graph denoising a dilemma and challenging problem. In this paper, we develop a unified graph denoising (UGD) framework to unravel the deadlock between structure and feature denoising. Specifically, a high-order neighborhood proximity evaluation method is proposed to recognize noisy edges, considering features may be perturbed simultaneously. Moreover, we propose to refine noisy features with reconstruction based on a graph auto-encoder. An iterative updating algorithm is further designed to optimize the framework and acquire a clean graph, thus enabling robust graph learning for downstream tasks. Our UGD framework is self-supervised and can be easily implemented as a plug-and-play module. We carry out extensive experiments, which proves the effectiveness and advantages of our method. Code is avalaible at https://github.com/YoungTimmy/UGD. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_00700 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | You Can't Ignore Either: Unifying Structure and Feature Denoising for Robust Graph Learning Yang, Tianmeng Meng, Jiahao Zhou, Min Yang, Yaming Wang, Yujing Li, Xiangtai Tong, Yunhai Machine Learning Recent research on the robustness of Graph Neural Networks (GNNs) under noises or attacks has attracted great attention due to its importance in real-world applications. Most previous methods explore a single noise source, recovering corrupt node embedding by reliable structures bias or developing structure learning with reliable node features. However, the noises and attacks may come from both structures and features in graphs, making the graph denoising a dilemma and challenging problem. In this paper, we develop a unified graph denoising (UGD) framework to unravel the deadlock between structure and feature denoising. Specifically, a high-order neighborhood proximity evaluation method is proposed to recognize noisy edges, considering features may be perturbed simultaneously. Moreover, we propose to refine noisy features with reconstruction based on a graph auto-encoder. An iterative updating algorithm is further designed to optimize the framework and acquire a clean graph, thus enabling robust graph learning for downstream tasks. Our UGD framework is self-supervised and can be easily implemented as a plug-and-play module. We carry out extensive experiments, which proves the effectiveness and advantages of our method. Code is avalaible at https://github.com/YoungTimmy/UGD. |
| title | You Can't Ignore Either: Unifying Structure and Feature Denoising for Robust Graph Learning |
| topic | Machine Learning |
| url | https://arxiv.org/abs/2408.00700 |