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.
Code (1)
Tasks
Active LearningClusteringCommunity DetectionSingle Particle AnalysisSimilar Papers 제목 키워드 기반
Incorporating Higher-order Structural Information for Graph Clustering
Clustering holds profound significance in data mining. In recent years, graph convolutional network (GCN) has emerged as a powerful tool for deep clustering, integrating both graph structural information and node attribu…
ClusteringDeep ClusteringGraph ClusteringClustering Bioactive Molecules in 3D Chemical Space with Unsupervised Deep Learning
Unsupervised clustering has broad applications in data stratification, pattern investigation and new discovery beyond existing knowledge. In particular, clustering of bioactive molecules facilitates chemical space mappin…
ClusteringDiversityDrug DiscoveryUnsupervised Graph Clustering with Deep Structural Entropy
Research on Graph Structure Learning (GSL) provides key insights for graph-based clustering, yet current methods like Graph Neural Networks (GNNs), Graph Attention Networks (GATs), and contrastive learning often rely hea…
ClusteringContrastive LearningGraph AttentionGraph Clustering+1StruClus: Structural Clustering of Large-Scale Graph Databases
We present a structural clustering algorithm for large-scale datasets of small labeled graphs, utilizing a frequent subgraph sampling strategy. A set of representatives provides an intuitive description of each cluster, …
ClusteringLSEnet: Lorentz Structural Entropy Neural Network for Deep Graph Clustering
Graph clustering is a fundamental problem in machine learning. Deep learning methods achieve the state-of-the-art results in recent years, but they still cannot work without predefined cluster numbers. Such limitation mo…
ClusteringDeep ClusteringGraph Clustering