SAug: Structural Imbalance Aware Augmentation for Graph Neural Networks

被引:0
作者
Chen, Ke-Jia [1 ,2 ,3 ]
Mu, Wenhui [2 ]
Liu, Zulong [2 ]
Liu, Zheng [2 ]
机构
[1] Nanjing Univ Posts & Telecommun, Jiangsu Key Lab Big Data Secur & Intelligent Proc, Nanjing, Peoples R China
[2] Nanjing Univ Posts & Telecommun, Sch Comp Sci & Technol, Nanjing, Peoples R China
[3] Nanjing Univ, State Key Lab Novel Software Technol, Nanjing, Peoples R China
基金
中国国家自然科学基金;
关键词
Graph Neural Networks; Graph Representation Learning; Structural Imbalance; Data Augmentation;
D O I
10.1145/3712699
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Graph machine learning (GML) has made great progress in node classification, link prediction, graph classification, and so on. However, graphs in reality are often structurally imbalanced, that is, only a few hub nodes have a denser local structure and higher influence. The imbalance may compromise the robustness of existing GML models, especially in learning tail nodes. This article proposes a selective graph augmentation method to solve this problem. Firstly, a Pagerank-based sampling strategy is designed to identify hub nodes and tail nodes in the graph. Secondly, a selective augmentation strategy is proposed, which drops the noise neighbors of hub nodes on one side, and discovers the latent neighbors and generates pseudo neighbors for tail nodes on the other side. Also, it can alleviate the structural imbalance between two types of nodes. Finally, a GNN model is retrained on the augmented graph. Extensive experiments demonstrate that the proposed method can significantly improve the backbone GNNs and achieve superior performance to its competitors of graph augmentation methods and hub/tail aware methods.
引用
收藏
页数:22
相关论文
共 48 条
[1]   Scale-free networks [J].
Barabási, AL ;
Bonabeau, E .
SCIENTIFIC AMERICAN, 2003, 288 (05) :60-69
[2]   Graph Regularized Nonnegative Matrix Factorization for Data Representation [J].
Cai, Deng ;
He, Xiaofei ;
Han, Jiawei ;
Huang, Thomas S. .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2011, 33 (08) :1548-1560
[3]   SMOTE: Synthetic minority over-sampling technique [J].
Chawla, Nitesh V. ;
Bowyer, Kevin W. ;
Hall, Lawrence O. ;
Kegelmeyer, W. Philip .
2002, American Association for Artificial Intelligence (16)
[4]  
Chen DL, 2020, AAAI CONF ARTIF INTE, V34, P3438
[5]  
Ding Kaize, 2022, ACM SIGKDD Explorations Newsletter, P61, DOI 10.1145/3575637.3575646
[6]  
Giles C. L., 1998, Digital 98 Libraries. Third ACM Conference on Digital Libraries, P89, DOI 10.1145/276675.276685
[7]   Generative Adversarial Networks [J].
Goodfellow, Ian ;
Pouget-Abadie, Jean ;
Mirza, Mehdi ;
Xu, Bing ;
Warde-Farley, David ;
Ozair, Sherjil ;
Courville, Aaron ;
Bengio, Yoshua .
COMMUNICATIONS OF THE ACM, 2020, 63 (11) :139-144
[8]   Graph embedding techniques, applications, and performance: A survey [J].
Goyal, Palash ;
Ferrara, Emilio .
KNOWLEDGE-BASED SYSTEMS, 2018, 151 :78-94
[9]  
Hamilton WL, 2017, ADV NEUR IN, V30
[10]  
Huang Z., 2020, INT C MACHINE LEARNI, V119, P1725