
YY
Yuxin Yang, Limei Hu, Feng Chen
· 1 min read
ResearcharXiv cs.AI
DDGAD: Disagreement-Driven Graph Anomaly Detection via Adapt-Then-Combine
arXiv:2605.26446v3 Announce Type: replace-cross
Abstract: Graph anomaly detection (GAD) commonly relies on message passing to jointly encode node attributes and neighborhood context. However, once the two are mixed, an abnormal post-encoding state may reflect either an intrinsic node deviation or incompatible contextual influence, making its source ambiguous. We propose Disagreement-Driven Graph Anomaly Detection (DDGAD), which treats persistent incompatibility between node-wise and contextual estimates as anomaly evidence. Inspired by Adapt-Then-Combine (ATC), DDGAD reverses its consensus objective: Adapt produces a node-wise estimate without new same-step neighbor aggregation, while Combine forms a neighborhood-dependent contextual estimate, and their pre-consensus disagreement is accumulated across ATC steps for detection. We further characterize this signal from graph-spectral and source-response perspectives and derive sufficient conditions for anomaly--normal separation under contextual mixing. Experiments on six benchmarks show the highest average AUROC among the evaluated methods, while controlled interventions and Adapt-operator controls further support persistent disagreement as an effective detection signal.
Original source
This story was published by arXiv cs.AI and written by Yuxin Yang, Limei Hu, Feng Chen. SyncAI.news shows a preview; the complete article is on the publisher's site.
Read the full story on arxiv.org


