Global Attention-Based Graph Neural Networks for Node Classification

被引:2
作者
Chen, Jiusheng [1 ]
Fang, Chengyuan [1 ]
Zhang, Xiaoyu [1 ]
机构
[1] Civil Aviat Univ China, Coll Elect Informat & Automat, Tianjin 300300, Peoples R China
关键词
Graph attention network; Global attention; Node classification; Clustering;
D O I
10.1007/s11063-022-11032-z
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Graph attention networks (GATs) is an important method for processing graph data. The traditional GAT method can extract features from neighboring nodes, but the abilities of obtaining features from distant nodes and learning the global structure of the graph are insufficient. To tackle this issue, a new model Global Attention-based Graph Neural Networks (GA-GNN) has been proposed, with two improvements aimed at improving the global feature learning ability. Firstly, in order to improve the efficiency of global information acquisition, the basic graph structure is obtained by K-means clustering method, and the training set is re-selected with wider influencing scope according to the obtained structure. Secondly, the relation influential features are designed to represent the influence between node groups, and added to the node feature to improve the global expression ability of nodes. The node classification task performed on three citation network datasets shows that the performance of our proposed method is better than that of other baseline methods.
引用
收藏
页码:4127 / 4150
页数:24
相关论文
共 49 条
[1]  
[Anonymous], 2014, P 2 INT C LEARN REPR
[2]   Which Centralities Fit the Best? Network Centralities' Ranking Based on the F-Measure [J].
Belik, Ivan .
CYBERNETICS AND SYSTEMS, 2023, 54 (04) :454-473
[3]   Graph Neural Networks With Convolutional ARMA Filters [J].
Bianchi, Filippo Maria ;
Grattarola, Daniele ;
Livi, Lorenzo ;
Alippi, Cesare .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2022, 44 (07) :3496-3507
[4]  
Brody S., 2021, ARXIV
[5]   Geometric Deep Learning Going beyond Euclidean data [J].
Bronstein, Michael M. ;
Bruna, Joan ;
LeCun, Yann ;
Szlam, Arthur ;
Vandergheynst, Pierre .
IEEE SIGNAL PROCESSING MAGAZINE, 2017, 34 (04) :18-42
[6]   Top influencers can be identified universally by combining classical centralities [J].
Bucur, Doina .
SCIENTIFIC REPORTS, 2020, 10 (01)
[7]  
Chen M, 2020, PR MACH LEARN RES, V119
[8]   Cluster-GCN: An Efficient Algorithm for Training Deep and Large Graph Convolutional Networks [J].
Chiang, Wei-Lin ;
Liu, Xuanqing ;
Si, Si ;
Li, Yang ;
Bengio, Samy ;
Hsieh, Cho-Jui .
KDD'19: PROCEEDINGS OF THE 25TH ACM SIGKDD INTERNATIONAL CONFERENCCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2019, :257-266
[9]  
Defferrard M, 2016, ADV NEUR IN, V29
[10]   Review of Modeling and Simulation Methods for Cyber Physical Power System [J].
Fan, Hong ;
Wang, Hongxiang ;
Xia, Shiwei ;
Li, Xuan ;
Xu, Pengfei ;
Gao, Yuhan .
FRONTIERS IN ENERGY RESEARCH, 2021, 9