arXiv:2608. 16018v1 Announce Type: cross Abstract: Graph anomaly detection aims to identify nodes that deviate from normal behavioral patterns within graphs.
Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.
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.
arXiv:2602. 20019v2 Announce Type: replace-cross Abstract: Dynamic graph anomaly detection is critical for many real-world applications but remains challenging due to the scarcity of labeled anomalies.
arXiv:2606. 12673v1 Announce Type: cross Abstract: Cross-domain graph anomaly detection (GAD) aims to identify abnormal nodes in unseen target graphs, showing strong potential in real-world applications with heterogeneous graph data.
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.
arXiv:2608. 10699v1 Announce Type: cross Abstract: Text-Attributed Graphs (TAGs), endowed with abundant textual content along with topological structures, have emerged as a versatile backbone for real-world anomaly detection spanning large language model security, social network moderation, and cyber threat identification.
arXiv:2609.38424v1 Announce Type: new Abstract: Node-level graph anomaly detection (GAD) identifies nodes whose attributes and interactions deviate from dominant graph regularities. Existing GAD mode...