DropEdge not Foolproof: Effective Augmentation Method for Signed Graph Neural Networks
The paper discusses signed graphs, which model friendly or antagonistic relationships using edges marked with positive or negative signs, focusing on the task of link sign prediction. While Signed Graph Neural Networks (SGNNs) have advanced, they face challenges like graph sparsity and unbalanced triangles. The authors propose using data augmentation (DA) techniques to address these issues, although many existing methods are not suitable for signed graphs due to a lack of side information. They highlight that the random DropEdge method, a rare DA approach applicable to signed graphs, does not enhance link sign prediction performance. In response, they introduce the Signed Graph Augmentation (SGA) framework, which includes a structure augmentation module to identify candidate edges and a strategy for selecting beneficial candidates, ultimately improving SGNN training. Experimental results show that SGA significantly boosts the performance of SGNN models, with a notable 32.3% improvement in F1-micro for SGCN on the Slashdot dataset.
Code (0)
등록된 구현이 없습니다.
Tasks
Data AugmentationLink Sign PredictionSimilar Papers 제목 키워드 기반
Training Robust Graph Neural Networks with Topology Adaptive Edge Dropping
Graph neural networks (GNNs) are processing architectures that exploit graph structural information to model representations from network data. Despite their success, GNNs suffer from sub-optimal generalization performan…
Data AugmentationDropEdge: Towards Deep Graph Convolutional Networks on Node Classification
\emph{Over-fitting} and \emph{over-smoothing} are two main obstacles of developing deep Graph Convolutional Networks (GCNs) for node classification. In particular, over-fitting weakens the generalization ability on small…
ClassificationGeneral ClassificationNode ClassificationStructure-Aware DropEdge Towards Deep Graph Convolutional Networks
It has been discovered that Graph Convolutional Networks (GCNs) encounter a remarkable drop in performance when multiple layers are piled up. The main factor that accounts for why deep GCNs fail lies in over-smoothing, w…
Node ClassificationEffects of Random Edge-Dropping on Over-Squashing in Graph Neural Networks
Message Passing Neural Networks (MPNNs) are a class of Graph Neural Networks (GNNs) that leverage the graph topology to propagate messages across increasingly larger neighborhoods. The message-passing scheme leads to two…
ABCDE: Approximating Betweenness-Centrality ranking with progressive-DropEdge
Betweenness-centrality is a popular measure in network analysis that aims to describe the importance of nodes in a graph. It accounts for the fraction of shortest paths passing through that node and is a key measure in m…
Approximating Betweenness-Centrality rankingCommunity Detection