Hierarchical supergraph neural networks for link prediction
摘要
Link prediction is an important task in network analysis that aims to estimate missing or future connections between nodes in complex graphs. Recent Graph Neural Network (GNN)-based methods have shown promising performance; however, many existing approaches mainly focus on local neighborhood aggregation and often fail to capture higher-order structural information and community relationships effectively. To overcome these limitations, this paper proposes a Hierarchical Supergraph Neural Network framework for Link Prediction. The proposed framework performs hierarchical representation learning at two levels: node-level learning on the original graph and community-level learning on a community-aware supergraph. The supergraph is constructed by representing communities as supernodes and inter-community relationships as superedges, enabling the model to capture both local and global structural dependencies. The framework integrates Graph Attention Network (GAT)-based node embeddings, community-level representations, node influence information, global graph statistics, and structural heuristic features within a unified architecture. An attention-based fusion mechanism is further employed to combine multi-level graph representations for improved link prediction. Experimental results on several real-world benchmark datasets demonstrate that the proposed framework achieves effective and robust performance compared with existing link prediction methods in terms of AUROC and AUPR.