Hypergraph Neural Networks Based on Enclosing Subgraph Extraction for Temporal Link Prediction
The Graph Neural Network (GNN) methods based on enclosing subgraph extraction have achieved excellent results in static graph link prediction tasks. However, most real-world networks are dynamic and evolve over time; the traditional models cannot capture temporal evolution. Moreover, the existing temporal link prediction methods mainly use simple GNNs to learn spatial embeddings, which not only ignore the high-order relationships and local clustering structures between node, but also perform poorly in static graph link prediction tasks. In order to address the above problems, we propose Hypergraph for temporal link prediction (HGTLP) which is based on enclosing subgraph extraction. The proposed HGTLP constructs hypergraph through enclosing subgraph extraction and dual hypergraph transformation to learn the high-order spatial and temporal embeddings of each link to be predicted, and then combines the global knowledge of the collapsed graph to improve the prediction accuracy. Experimental results demonstrate that HGTLP achieves significant performance improvement compared to the state-of-the-art models in both link prediction and new link prediction tasks.
Authors
- Atul Sajjanhar (ORCID: https://orcid.org/0000-0002-0445-0573)
- Junjun Chen (ORCID: https://orcid.org/0009-0001-7186-3845)
- Liang Chen (ORCID: https://orcid.org/0009-0000-1775-363X)
- Ying Zhao (ORCID: https://orcid.org/0000-0001-6228-5433)
- Xiuzhe Meng
Institutions
- Deakin University (AU)
- Peking University (CN)
- Beijing University of Chemical Technology (CN)
Publication Details
- Journal
- IEEE Access
- Published
- 2025-01-01
- DOI
- https://doi.org/10.1109/access.2025.3611308
- Primary Topic
- Advanced Text Analysis Techniques
- Type
- article
- Field-Weighted Citation Impact
- 0.00