Adaptive node similarity for DropEdge

Yangcai Xie

doi:10.1016/j.neucom.2025.129574

Return

Adaptive node similarity for DropEdge

2025-04-01

PRE

Yangcai Xie

Jiecheng Li

Shichao Zhang *

DOI：10.1016/j.neucom.2025.129574

Original

Original request for help

Save

Abstract

En 中文

There are two principal impediments of expanding deep graph convolutional networks (GCNs) due to the assumption of smoothness, i.e., over-fitting and over-smoothing. DropEdge methods relieve the convergence speed and reduce the information loss by randomly dropping a specific rate of edges, hence effectively alleviates these two issues and has been widely used to many backbone models. However, thanks to the blindness and potential risks of randomly removing edges, current DropEdge methods often remove important edges and retain unimportant edges, this inevitably reduce the accuracy of learning results. In order to tackle the challenges in previous DropEdge methods, this paper proposes a precise removal technique through the node similarity, which is closely related to edges. Specifically, we employ the hybrid optimal node similarity to drop edges, on the one hand, the edges that severely affect over-fitting and over-smoothing of nodes, i.e., the edges with high node similarity, are removed; on the other hand, the edges that are outliers and noisy, i.e., the edges with a large difference in similarity to normal nodes, are also removed. Therefore, our methods significantly alleviate over-fitting and over-smoothing, accurately reduce the impact of outliers and noise, more importantly, our methods is a generic skill that can be deployed current GCN and its variants. Experimental results on seven benchmark datasets including three assortative datasets and four disassortative datasets show that our methods outperforms the state-of-the-art methods, improve the performance by a large margin especially for disassortative graphs.

Keywords:

Node similarity

Remove edge

Graph convolutional networks