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

Institutions

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Hypergraph Neural Networks Based on Enclosing Subgraph Extraction for Temporal Link Prediction

Atul Sajjanhar, Junjun Chen, Liang Chen, Ying Zhao et al.
IEEE Access
Advanced Text Analysis Techniques
article

Hypergraph Neural Networks Based on Enclosing Subgraph Extraction for Temporal Link Prediction

Atul Sajjanhar, Junjun Chen, Liang Chen, Ying Zhao, Xiuzhe Meng
article en

Abstract

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.

IEEE AccessVol. 13
Deakin University (AU), Peking University (CN), Beijing University of Chemical Technology (CN)
Openalex Percentile: Top 87%
Advanced Text Analysis Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.