DDGAD introduces a novel approach to graph anomaly detection that focuses on the disagreement between node-wise and contextual estimates rather than on their combined state. By adapting the Adapt-Then-Combine framework, DDGAD generates separate node-wise and neighborhood-dependent estimates, accumulating their pre-consensus disagreement across iterations to identify anomalies. The method is theoretically grounded with graph-spectral and source-response analyses, and empirical results on six benchmarks demonstrate superior AUROC performance compared to existing techniques.
By Yuxin Yang, Limei Hu, Feng Chen
FoundAna is a GNN‑assisted foundation model designed for graph anomaly detection across diverse datasets. It combines a GNN component with a transformer encoder enhanced by four positional encodings to capture both local and global structure, using reconstruction errors as anomaly scores. Experiments on nine benchmark datasets from financial, social, and citation networks show that FoundAna consistently outperforms state‑of‑the‑art baselines.
By Suprim Nakarmi, Chahana Dahal, Yue Zhao, Junggab Son, Zuobin Xiong
arXiv:2602.06859v3 Announce Type: replace-cross
Abstract: Graph Anomaly Detection (GAD) aims to identify irregular patterns in graph data, and recent works have explored zero-shot generalist GAD to e...
By Xinyu Zhao, Qingyun Sun, Jiayi Luo, Xingcheng Fu, Jianxin Li
arXiv:2606. 00304v1 Announce Type: new Abstract: Graph anomaly detection methods aim to distinguish anomalous nodes.
By Yilin Liu, Hongchao Zhang, Taylor T. Johnson, Ahmad F. Taha, Meiyi Ma
RINSE (Robust Iterative Normality Self-Estimation) is a gradient‑free framework for zero‑shot graph anomaly detection that keeps a source‑trained detector fixed while iteratively estimating target normality, calibrating representations, and assessing evidence reliability on unseen target graphs. It identifies a reliable subset of low‑residual target nodes to build a trimmed target‑aware normality model and fuses complementary anomaly evidence through reliability‑gated rank fusion and encoder ensembling. Across eight unseen target graphs, RINSE achieves the highest average AUPRC under two preprocessing protocols, with ablation and sensitivity analyses supporting its combined design.
By Taufikur Rahman Fuad, Md Abrar Jahin, Amir Hussain
arXiv:2605.26857v2 Announce Type: replace
Abstract: Driven by the pressing demand for graph anomaly detection (GAD) in high-stakes domains, the generalist GAD paradigm, which trains a single detector...
By Yiming Xu, Zihan Chen, Zhen Peng, Song Wang, Bin Shi, Bo Dong, Chao Shen
The paper introduces JPGFN, a graph anomaly detection method that enhances frequency-domain filtering with a Feature Separation Transformation Network to capture fine-grained node features, an adaptive Jacobi polynomial graph filtering module to better model complex frequency-domain characteristics, and a node label constraint module to leverage label information. These components address limitations of static filters, attribute importance neglect, and insufficient label use found in existing approaches. Experiments on real-world datasets show that JPGFN outperforms mainstream methods.
By Xiang Wang, Zhijun Cheng, Zhenyu Meng
The paper introduces Unsupervised Graph Collective Anomaly Detection (UGCAD), a framework that uses a variational graph autoencoder to learn graph representations of IoT network traffic and then enhances clustering to group nodes. UGCAD identifies collective anomalies by aggregating normal clusters and applying anomaly scores to the refined groups. Experiments on CICIoT2023 and ToN-IoT datasets show that UGCAD outperforms traditional and state‑of‑the‑art clustering‑based CAD methods in both clustering quality and anomaly detection accuracy.
By Dalila Khettaf, Djamel Djenouri, Zeinab Rezaeifar, Youcef Djenouri
arXiv:2511. 22078v2 Announce Type: replace Abstract: Many real-world scenarios involving streaming information can be represented as temporal graphs, where data flows through dynamic changes in edges over time.
By Simone Mungari, Albert Bifet, Giuseppe Manco, Bernhard Pfahringer
arXiv:2510. 02014v3 Announce Type: replace Abstract: Graph anomaly detection (GAD) has attracted growing interest for its crucial ability to uncover irregular patterns in broad applications.
By Guolei Zeng, Hezhe Qiao, Guoguo Ai, Jinsong Guo, Guansong Pang
arXiv:2505. 21285v5 Announce Type: replace Abstract: This work proposes a framework LGKDE that learns kernel density estimation for graphs.
By Xudong Wang, Ziheng Sun, Chris Ding, Jicong Fan
GLASS is a graph‑level anomaly detection framework that aligns graph and language representations on a unit hypersphere to achieve cross‑domain transferability. It constructs a Graph Descriptor Prompt to encode local, global, and semantic graph properties, and uses a multi‑slice soft cosine objective to unify graph and text embeddings. Anomaly scoring is performed via spherical density estimation with von Mises‑Fisher kernels, enabling zero‑shot detection and few‑shot adaptation across twelve benchmarks and three meta‑domains, outperforming recent GLAD baselines.
By Xudong Wang, Chris Ding, Tongxin Li, Jicong Fan