{"title":"Deep Temporal and Structural Embeddings for Robust Unsupervised Anomaly Detection in Dynamic Graphs","authors":"Samir Abdaljalil;Hasan Kurban;Rachad Atat;Erchin Serpedin;Khalid Qaraqe","doi":"10.1109/OJCS.2025.3584942","DOIUrl":null,"url":null,"abstract":"Detecting anomalies in dynamic graphs is a complex yet essential task, as existing methods often fail to capture long-term dependencies required for identifying irregularities in evolving networks. We introduce Temporal Structural Graph Anomaly Detection (<sc>T-StructGAD</small>), an unsupervised framework that leverages Graph Convolutional Gated Recurrent Units (<monospace>GConvGRU</monospace>s) and Long Short-Term Memory networks (<monospace>LSTM</monospace>s) to jointly model both structural and temporal dynamics in graph node embeddings. Anomalies are detected using reconstruction errors generated by an AutoEncoder, enabling the framework to robustly uncover deviations across time. Our method successfully captures temporal patterns, making it robust against subtle anomalies and structural changes. Comprehensive evaluations on four real-world datasets demonstrate that <sc>T-StructGAD</small> consistently outperforms 12 state-of-the-art unsupervised anomaly detection models, showcasing its superior ability to detect complex anomalies in evolving graphs. This work advances anomaly detection in dynamic graphs by integrating deep learning techniques to address structural and temporal irregularities in a more effective manner.","PeriodicalId":13205,"journal":{"name":"IEEE Open Journal of the Computer Society","volume":"6 ","pages":"1100-1109"},"PeriodicalIF":0.0000,"publicationDate":"2025-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11068181","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Open Journal of the Computer Society","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/11068181/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Detecting anomalies in dynamic graphs is a complex yet essential task, as existing methods often fail to capture long-term dependencies required for identifying irregularities in evolving networks. We introduce Temporal Structural Graph Anomaly Detection (T-StructGAD), an unsupervised framework that leverages Graph Convolutional Gated Recurrent Units (GConvGRUs) and Long Short-Term Memory networks (LSTMs) to jointly model both structural and temporal dynamics in graph node embeddings. Anomalies are detected using reconstruction errors generated by an AutoEncoder, enabling the framework to robustly uncover deviations across time. Our method successfully captures temporal patterns, making it robust against subtle anomalies and structural changes. Comprehensive evaluations on four real-world datasets demonstrate that T-StructGAD consistently outperforms 12 state-of-the-art unsupervised anomaly detection models, showcasing its superior ability to detect complex anomalies in evolving graphs. This work advances anomaly detection in dynamic graphs by integrating deep learning techniques to address structural and temporal irregularities in a more effective manner.