Adversarially Regularized Graph Attention Networks for Inductive Learning on Partially Labeled Graphs
원문 초록
The high cost of data labeling often results in node label shortage in real applications. To improve node classification accuracy, graph-based semi-supervised learning leverages the ample unlabeled nodes to train together with the scarce available labeled nodes. However, most existing methods require the information of all nodes, including those to be predicted, during model training, which is not practical for dynamic graphs with newly added nodes. To address this issue, an adversarially regularized graph attention model is proposed to classify newly added nodes in a partially labeled graph. An attention-based aggregator is designed to generate the representation of a node by aggregating information from its neighboring nodes, thus naturally generalizing to previously unseen nodes. In addition, adversarial training is employed to improve the model's robustness and generalization ability by enforcing node representations to match a prior distribution. Experiments on real-world datasets demonstrate the effectiveness of the proposed method in comparison with the state-of-the-art methods. The code is available at https://github.com/JiarenX/AGAIN.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
HGATE: Heterogeneous Graph Attention Auto-Encoders
Balancing Graph Embedding Smoothness in Self-Supervised Learning via Information-Theoretic Decomposition
Graph Attention for Heterogeneous Graphs with Positional Encoding
Weighted Graph Structure Learning with Attention Denoising for Node Classification
LiDAR Loop Closure Detection using Semantic Graphs with Graph Attention Networks
FHGE: A Fast Heterogeneous Graph Embedding with Ad-hoc Meta-paths
토론
이 논문과 연결된 포럼 글이 아직 없습니다.