A Structural-Clustering Based Active Learning for Graph Neural Networks
원문 초록
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 crucial 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 higher accuracy and macro-F1 score over existing methods across different annotation budgets and achieves significant 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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Strongly Consistent Community Detection in Popularity Adjusted Block Models
Speaker Diarization with Overlapping Community Detection Using Graph Attention Networks and Label Propagation Algorithm
On the Price of Differential Privacy for Spectral Clustering over Stochastic Block Models
MRAEA: An Efficient and Robust Entity Alignment Approach for Cross-lingual Knowledge Graph
Using deep learning for community discovery in social networks
High Quality, Scalable and Parallel Community Detectionfor Large Real Graphs
토론
이 논문과 연결된 포럼 글이 아직 없습니다.