Global-Local Graph Neural Networks for Node-Classification
원문 초록
The task of graph node classification is often approached by utilizing a local Graph Neural Network (GNN), that learns only local information from the node input features and their adjacency. In this paper, we propose to improve the performance of node classification GNNs by utilizing both global and local information, specifically by learning label- and node- features. We therefore call our method Global-Local-GNN (GLGNN). To learn proper label features, for each label, we maximize the similarity between its features and nodes features that belong to the label, while maximizing the distance between nodes that do not belong to the considered label. We then use the learnt label features to predict the node classification map. We demonstrate our GLGNN using three different GNN backbones, and show that our approach improves baseline performance, revealing the importance of global information utilization for node classification.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Graph Semi-Supervised Learning for Point Classification on Data Manifolds
HGOT: Self-supervised Heterogeneous Graph Neural Network with Optimal Transport
Directed Homophily-Aware Graph Neural Network
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
토론
이 논문과 연결된 포럼 글이 아직 없습니다.