Efficient and Robust Continual Graph Learning for Graph Classification in Biology

Graph classification is essential for understanding complex biological systems, where molecular structures and interactions are naturally represented as graphs. Traditional graph neural networks (GNNs) perform well on static tasks but struggle in dynamic settings due to catastrophic forgetting. We present Perturbed and Sparsified Continual Graph Learning (PSCGL), a robust and efficient continual graph learning framework for graph data classification, specifically targeting biological datasets. We introduce a perturbed sampling strategy to identify critical data points that contribute to model learning and a motif-based graph sparsification technique to reduce storage needs while maintaining performance. Additionally, our PSCGL framework inherently defends against graph backdoor attacks, which is crucial for applications in sensitive biological contexts. Extensive experiments on biological datasets demonstrate that PSCGL not only retains knowledge across tasks but also enhances the efficiency and robustness of graph classification models in biology.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Signal and Information Processing over Networks
Published
2025-01-01
DOI
https://doi.org/10.1109/tsipn.2025.3592321
Primary Topic
Machine Learning in Bioinformatics
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Efficient and Robust Continual Graph Learning for Graph Classification in Biology

Ren Wang, Ding Zhang, Can Chen, Jane Downer
IEEE Transactions on Signal and Information Processing over Networks
Machine Learning in Bioinformatics
article

Efficient and Robust Continual Graph Learning for Graph Classification in Biology

Ren Wang, Ding Zhang, Can Chen, Jane Downer
article en

Abstract

Graph classification is essential for understanding complex biological systems, where molecular structures and interactions are naturally represented as graphs. Traditional graph neural networks (GNNs) perform well on static tasks but struggle in dynamic settings due to catastrophic forgetting. We present Perturbed and Sparsified Continual Graph Learning (PSCGL), a robust and efficient continual graph learning framework for graph data classification, specifically targeting biological datasets. We introduce a perturbed sampling strategy to identify critical data points that contribute to model learning and a motif-based graph sparsification technique to reduce storage needs while maintaining performance. Additionally, our PSCGL framework inherently defends against graph backdoor attacks, which is crucial for applications in sensitive biological contexts. Extensive experiments on biological datasets demonstrate that PSCGL not only retains knowledge across tasks but also enhances the efficiency and robustness of graph classification models in biology.

IEEE Transactions on Signal and Information Processing over NetworksVol. 11
Northwestern University (US), University of North Carolina at Chapel Hill (US), Illinois Institute of Technology (US)
Openalex Percentile: Top 84%
Machine Learning in Bioinformatics
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.

Efficient and Robust Continual Graph Learning for Graph Classification in Biology — Ren Wang, Ding Zhang, et al. · IEEE Transactions on Signal and Information Processing over Networks (2025) | TGRS Research Map | TGRS