DI-GAE: A Dynamic and Resource-Efficient Attack Detection Framework with Incremental Learning and Graph Autoencoders

Data-driven deep learning methods have made significant strides in attack detection, with provenance graph analysis based on audit logs emerging as a key approach for identifying complex threats. However, the inherent "redundancy" and "dynamic variability" in audit logs pose two major challenges: redundant data leads to inefficient use of computational resources during model training, and shifts in data distribution over time can degrade detection performance. To address these challenges, we propose DI-GAE, a framework that is both resource-efficient and dynamically adaptive. We initially train a graph autoencoder on benign data. As data distribution changes, Behavior Pattern Scores (BPS) are applied at the time-window level to probe new behavioral patterns while filtering out redundant benign data, allowing for dynamic updates through incremental learning. Additionally, we integrate data replay and Elastic Weight Consolidation (EWC) strategies to ensure the model retains existing patterns while learning new ones. Experimental results demonstrate that DI-GAE not only conserves resources and adapts dynamically but also achieves detection performance comparable to state-of-the-art frameworks. Furthermore, we provide a detailed analysis of the model’s components, illustrating its ability to learn new patterns and maintain existing knowledge.

Authors

Institutions

Publication Details

Published
2024-12-17
DOI
https://doi.org/10.1109/trustcom63139.2024.00314
Primary Topic
Network Security and Intrusion Detection
Type
article
Field-Weighted Citation Impact
0.00

Funders

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

DI-GAE: A Dynamic and Resource-Efficient Attack Detection Framework with Incremental Learning and Graph Autoencoders

Ru Zhang, Jianyi Liu, M Tan
Network Security and Intrusion Detection
article

DI-GAE: A Dynamic and Resource-Efficient Attack Detection Framework with Incremental Learning and Graph Autoencoders

Ru Zhang, Jianyi Liu, M Tan
article en

Abstract

Data-driven deep learning methods have made significant strides in attack detection, with provenance graph analysis based on audit logs emerging as a key approach for identifying complex threats. However, the inherent "redundancy" and "dynamic variability" in audit logs pose two major challenges: redundant data leads to inefficient use of computational resources during model training, and shifts in data distribution over time can degrade detection performance. To address these challenges, we propose DI-GAE, a framework that is both resource-efficient and dynamically adaptive. We initially train a graph autoencoder on benign data. As data distribution changes, Behavior Pattern Scores (BPS) are applied at the time-window level to probe new behavioral patterns while filtering out redundant benign data, allowing for dynamic updates through incremental learning. Additionally, we integrate data replay and Elastic Weight Consolidation (EWC) strategies to ensure the model retains existing patterns while learning new ones. Experimental results demonstrate that DI-GAE not only conserves resources and adapts dynamically but also achieves detection performance comparable to state-of-the-art frameworks. Furthermore, we provide a detailed analysis of the model’s components, illustrating its ability to learn new patterns and maintain existing knowledge.

Beijing University of Posts and Telecommunications (CN)
Beijing University of Posts and Telecommunications
Decent work and economic growth
Openalex Percentile: Top 65%
Network Security and Intrusion Detection
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.