Online test-time adaptation for generalizable DGAD is formulated and a proposed OTTA-DGAD, which selectively retains general patterns shared across the source domains used for pretraining while incorporating new patterns from the target domain.
Abstract
Generalizable dynamic graph anomaly detection (DGAD) enables pretrained detectors to identify anomalies in unseen target domains without costly retraining. However, existing methods often fail for two reasons. First, they mainly rely on domain-agnostic patterns and miss domain-specific patterns that keep evolving. Second, they assume access to the full target domain data, whereas in more practical online test-time adaptation settings, target data arrive sequentially in unlabeled chunks. To address these limitations, we formulate online test-time adaptation for generalizable DGAD and propose OTTA-DGAD. OTTA-DGAD first extracts dynamic prototypes, i.e., evolving representations of normal and anomalous patterns, from temporal ego-graphs and stores them in a memory buffer. The buffer selectively retains general patterns shared across the source domains used for pretraining while incorporating new patterns from the target domain. An anomaly scorer then compares incoming edge representations against these prototypes to identify both general and domain-specific anomalies. During adaptation, OTTA-DGAD updates the memory buffer using reliable pseudo-labels identified through confidence-based detection. It further enriches each target chunk with relevant representations retained from previous chunks, compensating for information loss resulting from the sequential arrival of data. Extensive experiments under strict test-then-adapt OTTA settings demonstrate state-of-the-art performance on ten real-world datasets from diverse domains.
Multi-View Semi-Supervised Graph Anomaly Detection (MSGAD) is introduced, an innovative framework tailored for detecting anomalies in dynamic graph environments that enhances robustness against noise and unexpected events while improving sensitivity to subtle anomalous signals distributed across time.
Yi-Fan Song, Yu Yang, Kang-Zheng Liu et al.· World wide web (Bussum)· 0 citations
BAD is proposed, an unsupervised framework for anomaly detection in continuous-time dynamic graphs that represents nodes with learnable identity embeddings and performs pairwise compatibility modeling via cross-attention between each destination node and the source’s recent neighbors, enabling direct characterization o...
Jia-Chi Luo, Sha-Meng Wen, Zi-Yan Qiu et al.· Proceedings of the Thirty-Fi...· 0 citations
FindAna is introduced, a GNN-assisted Foundation Model for Graph Anomaly Detection - the first foundation model framework designated for generalizable, cross-graph anomaly detection by combining GNNs and transformers.
Suprim Nakarmi, Chahana Dahal, Yue Zhao et al.· 0 citations
Generalist graph anomaly detection (GAD) aims to build a foundation model that detects anomalies on arbitrary unseen graphs without retraining or fine-tuning. Sufficient data are essential for foundation model training, yet generalist GAD still faces a data shortage, as real-world anomalous graphs are scarce and costly...
Yu-Jing Liu, Yi-Xin Liu, Yue Tan et al.· 0 citations
Time-series anomaly detection (TSAD) is difficult to generalize across datasets because heterogeneous temporal dynamics imply different notions of normality and favor different detection criteria. While time-series foundation models provide transferable representations, coupling them with a fixed anomaly-scoring mechan...
Tian Lan, Yi-Fei Gao, Yi-Meng Lu et al.· 0 citations
A statistical feature augmentation method that explicitly encodes behavioral interaction statistics into the input feature space and consistently improves detection performance is proposed, showcasing a promising approach for merging classical network analysis with deep learning.
Philipp Schlinge, Jean-Luc Schnipper, M. Atzmueller· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.