Boosting-GNN: Boosting Algorithm for Graph Networks on Imbalanced Node Classification
원문 초록
The Graph Neural Network (GNN) has been widely used for graph data representation. However, the existing researches only consider the ideal balanced dataset, and the imbalanced dataset is rarely considered. Traditional methods such as resampling, reweighting, and synthetic samples that deal with imbalanced datasets are no longer applicable in GNN. This paper proposes an ensemble model called Boosting-GNN, which uses GNNs as the base classifiers during boosting. In Boosting-GNN, higher weights are set for the training samples that are not correctly classified by the previous classifier, thus achieving higher classification accuracy and better reliability. Besides, transfer learning is used to reduce computational cost and increase fitting ability. Experimental results indicate that the proposed Boosting-GNN model achieves better performance than GCN, GraphSAGE, GAT, SGC, N-GCN, and most advanced reweighting and resampling methods on synthetic imbalanced datasets, with an average performance improvement of 4.5%
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Graph Semi-Supervised Learning for Point Classification on Data Manifolds
HGOT: Self-supervised Heterogeneous Graph Neural Network with Optimal Transport
Graph Positional Autoencoders as Self-supervised Learners
LEX-GNN: Label-Exploring Graph Neural Network for Accurate Fraud Detection
SplitGNN: Spectral Graph Neural Network for Fraud Detection against Heterophily
Prototype-based Interpretable Graph Neural Networks
토론
이 논문과 연결된 포럼 글이 아직 없습니다.