Experience replay with cohesive-subgraph awareness for continual graph learning in IoT

In Internet-of-Things (IoT) scenarios, Continual Graph Learning (CGL) has become a key technique for capturing the complex relational structures underlying diverse applications including sensor networks, road systems and biomedical networks. However, the structural changes in these evolving graphs introduce instability, making catastrophic forgetting a primary challenge for CGL. Experience replay is currently a promising method, as it strikes a balance between new and old knowledge. It also provides CGL models with a human-like memory capability. However, prior work rarely leverages the graph's intrinsic properties to proactively identify the critical patterns hiding in the evolving graphs. To this end, we propose a unified framework that integrates cohesion-subgraph awareness into existing CGL mechanisms. We propose a novel cohesive structure-aware experience replay framework that leverages intrinsic graph properties, such as k -core and k -truss metrics, to guide the selection of representative historical nodes for replay. Unlike conventional replay strategies that rely on random sampling or task-driven node selection, our approach systematically identifies structurally significant nodes that encapsulate the evolving patterns of streaming graphs. By integrating these cohesive subgraph properties into the experience replay process, our method effectively preserves critical historical knowledge while adapting to new graph structures with minimal computational overhead. The experimental results demonstrate that our method consistently outperforms existing replay strategies in mitigating catastrophic forgetting and maintaining classification performance. On the PubMed dataset, our k -core-based replay strategy improves the F 1 score by 3.7% compared to random sampling, while reducing training time by up to 85% compared to full retraining. Similarly, on the Cora dataset, our approach achieves a 98.3% F 1 score, surpassing baseline methods by 4.5%.

Authors

Institutions

Publication Details

Journal
Digital Communications and Networks
Published
2025-09-02
DOI
https://doi.org/10.1016/j.dcan.2025.08.010
Primary Topic
Advanced Graph Neural Networks
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Experience replay with cohesive-subgraph awareness for continual graph learning in IoT

Yi-Xue Yin, Yan Huang, Zhenzhen Xie, Jiaqi Zhang et al.
Digital Communications and Networks
Advanced Graph Neural Networks
article

Experience replay with cohesive-subgraph awareness for continual graph learning in IoT

Yi-Xue Yin, Yan Huang, Zhenzhen Xie, Jiaqi Zhang, Jian Pang, Qi Fang Luo
article en

Abstract

In Internet-of-Things (IoT) scenarios, Continual Graph Learning (CGL) has become a key technique for capturing the complex relational structures underlying diverse applications including sensor networks, road systems and biomedical networks. However, the structural changes in these evolving graphs introduce instability, making catastrophic forgetting a primary challenge for CGL. Experience replay is currently a promising method, as it strikes a balance between new and old knowledge. It also provides CGL models with a human-like memory capability. However, prior work rarely leverages the graph's intrinsic properties to proactively identify the critical patterns hiding in the evolving graphs. To this end, we propose a unified framework that integrates cohesion-subgraph awareness into existing CGL mechanisms. We propose a novel cohesive structure-aware experience replay framework that leverages intrinsic graph properties, such as k -core and k -truss metrics, to guide the selection of representative historical nodes for replay. Unlike conventional replay strategies that rely on random sampling or task-driven node selection, our approach systematically identifies structurally significant nodes that encapsulate the evolving patterns of streaming graphs. By integrating these cohesive subgraph properties into the experience replay process, our method effectively preserves critical historical knowledge while adapting to new graph structures with minimal computational overhead. The experimental results demonstrate that our method consistently outperforms existing replay strategies in mitigating catastrophic forgetting and maintaining classification performance. On the PubMed dataset, our k -core-based replay strategy improves the F 1 score by 3.7% compared to random sampling, while reducing training time by up to 85% compared to full retraining. Similarly, on the Cora dataset, our approach achieves a 98.3% F 1 score, surpassing baseline methods by 4.5%.

Digital Communications and NetworksVol. 12(3)
Shandong University of Technology (CN), Kennesaw State University (US), Changchun University of Technology (CN), Shandong University of Science and Technology (CN)
National Natural Science Foundation of China, Natural Science Foundation of Shandong Province, Young Scientists Fund
Openalex Percentile: Top 88%
Advanced Graph Neural Networks
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.