A Structural-Clustering Based Active Learning for Graph Neural Networks

被引:0
作者
Fajri, Ricky Maulana [1 ]
Pei, Yulong [1 ]
Yin, Lu [1 ,2 ]
Pechenizkiy, Mykola [1 ]
机构
[1] Eindhoven Univ Technol, Eindhoven, Netherlands
[2] Univ Aberdeen, Aberdeen, Scotland
来源
ADVANCES IN INTELLIGENT DATA ANALYSIS XXII, PT I, IDA 2024 | 2024年 / 14641卷
关键词
Active Learning; Structural-Clustering; PageRank; Graph Neural Network;
D O I
10.1007/978-3-031-58547-0_3
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In active learning for graph-structured data, Graph Neural Networks (GNNs) have shown effectiveness. However, a common challenge in these applications is the underutilization of important structural information. To address this problem, we propose the Structural-Clustering PageRank method for improved Active learning (SPA) specifically designed for graph-structured data. SPA integrates community detection using the SCAN algorithm with the PageRank scoring method for efficient and informative sample selection. SPA prioritizes nodes that are not only informative but also central in structure. Through extensive experiments, SPA demonstrates a higher accuracy and macro-F1 score over existing methods across different annotation budgets and achieves prominent reductions in query time. In addition, the proposed method only adds two hyperparameters, epsilon and mu in the algorithm to finely tune the balance between structural learning and node selection. This simplicity is a key advantage in active learning scenarios, where extensive hyperparameter tuning is often impractical.
引用
收藏
页码:28 / 40
页数:13
相关论文
共 16 条
[1]  
Bilgic Mustafa, 2010, Proceedings of the 27th International Conference on Machine Learning ICML-10
[2]  
Bojchevski A, 2018, 6 INT C LEARN REPR
[3]  
Clauset A, 2004, PHYS REV E, V70, DOI 10.1103/PhysRevE.70.066111
[4]  
Craven M, 2008, P 2008 C EMP METH NA, P1070
[5]  
Gao L, 2018, PROCEEDINGS OF THE TWENTY-SEVENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, P2142
[6]   Towards Active Learning on Graphs: An Error Bound Minimization Approach [J].
Gu, Quanquan ;
Han, Jiawei .
12TH IEEE INTERNATIONAL CONFERENCE ON DATA MINING (ICDM 2012), 2012, :882-887
[7]  
Hamilton WL, 2017, ADV NEUR IN, V30
[8]   SOPHIE velocimetry of Kepler transit candidates XVII. The physical properties of giant exoplanets within 400 days of period [J].
Santerne, A. ;
Moutou, C. ;
Tsantaki, M. ;
Bouchy, F. ;
Hebrard, G. ;
Adibekyan, V. ;
Almenara, J. -M. ;
Amard, L. ;
Barros, S. C. C. ;
Boisse, I. ;
Bonomo, A. S. ;
Bruno, G. ;
Courcol, B. ;
Deleuil, M. ;
Demangeon, O. ;
Diaz, R. F. ;
Guillot, T. ;
Havel, M. ;
Montagnier, G. ;
Rajpurohit, A. S. ;
Rey, J. ;
Santos, N. C. .
ASTRONOMY & ASTROPHYSICS, 2016, 587
[9]  
Ma J., 2023, Trans. Mach. Learn. Res.
[10]  
Mernyei P, 2022, Arxiv, DOI arXiv:2007.02901