TA-GGAD: Testing-time Adaptive Graph Model for Generalist Graph Anomaly Detection

• URL: http://arxiv.org/abs/2603.09349v1
• Date: Tue, 10 Mar 2026 08:30:19 GMT
• Title: TA-GGAD: Testing-time Adaptive Graph Model for Generalist Graph Anomaly Detection
• Abstract summary: A significant number of anomalous nodes in the real world, such as fake news, noncompliant users, malicious transactions, and malicious posts, severely compromises the health of the graph data ecosystem.<n>With anomalies that span multiple data domains yet exhibit vast differences in features, cross-domain detection models face severe domain shift issues.<n>This study identifies and quantitatively analyzes a specific feature mismatch pattern exhibited by domain shift in graph anomaly detection.
• Score: 17.723876789020565
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: A significant number of anomalous nodes in the real world, such as fake news, noncompliant users, malicious transactions, and malicious posts, severely compromises the health of the graph data ecosystem and urgently requires effective identification and processing. With anomalies that span multiple data domains yet exhibit vast differences in features, cross-domain detection models face severe domain shift issues, which limit their generalizability across all domains. This study identifies and quantitatively analyzes a specific feature mismatch pattern exhibited by domain shift in graph anomaly detection, which we define as the \emph{Anomaly Disassortativity} issue ($\mathcal{AD}$). Based on the modeling of the issue $\mathcal{AD}$, we introduce a novel graph foundation model for anomaly detection. It achieves cross-domain generalization in different graphs, requiring only a single training phase to perform effectively across diverse domains. The experimental findings, based on fourteen diverse real-world graphs, confirm a breakthrough in the model's cross-domain adaptation, achieving a pioneering state-of-the-art (SOTA) level in terms of detection accuracy. In summary, the proposed theory of $\mathcal{AD}$ provides a novel theoretical perspective and a practical route for future research in generalist graph anomaly detection (GGAD). The code is available at https://anonymous.4open.science/r/Anonymization-TA-GGAD/.

Related papers

• Learning Feature Encoder with Synthetic Anomalies for Weakly Supervised Graph Anomaly Detection [66.0756595768692]
  We introduce a weakly supervised graph anomaly detection method that leverages a feature learning strategy tailored for graph anomalies.<n>Our approach is built upon a multi-task learning scheme that extracts robust feature representations through synthesized anomalies.<n>Experiments on public datasets demonstrate the superior performance of our method over its competitors.
  arXiv  Detail & Related papers  (2026-05-12T08:27:06Z)
• Graph-Based Fraud Detection with Dual-Path Graph Filtering [52.459703746017624]
  Fraud detection on graph data requires distinguishing between different types of nodes.<n>This paper proposes a Graph-Based Fraud Detection Model with Dual-Path Graph Filtering.<n>Experiments on four real-world financial fraud detection datasets demonstrate the effectiveness of our proposed method.
  arXiv  Detail & Related papers  (2026-04-14T20:46:36Z)
• DP-DGAD: A Generalist Dynamic Graph Anomaly Detector with Dynamic Prototypes [43.326258937751625]
  Dynamic graph anomaly detection (DGAD) is essential for identifying anomalies in evolving graphs across domains such as finance, traffic, and social networks.<n>We propose a DGAD model with Dynamic Prototypes (DP) to capture evolving domain-specific and domain-agnostic patterns.<n>DP-DGAD employs confidence-based pseudo-labeling for effective self-supervised adaptation in target domains.
  arXiv  Detail & Related papers  (2025-08-01T14:35:50Z)
• A Graph-Based Framework for Interpretable Whole Slide Image Analysis [86.37618055724441]
  We develop a framework that transforms whole-slide images into biologically-informed graph representations.<n>Our approach builds graph nodes from tissue regions that respect natural structures, not arbitrary grids.<n>We demonstrate strong performance on challenging cancer staging and survival prediction tasks.
  arXiv  Detail & Related papers  (2025-03-14T20:15:04Z)
• AnomalyGFM: Graph Foundation Model for Zero/Few-shot Anomaly Detection [22.584555292512427]
  AnomalyGFM is a graph foundation model that supports zero-shot inference and few-shot prompt tuning for GAD.<n>We show that AnomalyGFM significantly outperforms state-of-the-art competing methods under both zero- and few-shot GAD settings.
  arXiv  Detail & Related papers  (2025-02-13T12:10:05Z)
• ADA-GAD: Anomaly-Denoised Autoencoders for Graph Anomaly Detection [84.0718034981805]
  We introduce a novel framework called Anomaly-Denoised Autoencoders for Graph Anomaly Detection (ADA-GAD) In the first stage, we design a learning-free anomaly-denoised augmentation method to generate graphs with reduced anomaly levels. In the next stage, the decoders are retrained for detection on the original graph.
  arXiv  Detail & Related papers  (2023-12-22T09:02:01Z)
• Improving Generalizability of Graph Anomaly Detection Models via Data Augmentation [30.81263206800531]
  Graph anomaly detection (GAD) is a vital task since even a few anomalies can pose huge threats to benign users. Recent semi-supervised GAD methods, which can effectively leverage the available labels as prior knowledge, have achieved superior performances than unsupervised methods. We propose a data augmentation method named textitAugAN to enrich training data and boost the generalizability of GAD models.
  arXiv  Detail & Related papers  (2023-06-18T11:54:18Z)
• From Unsupervised to Few-shot Graph Anomaly Detection: A Multi-scale Contrastive Learning Approach [26.973056364587766]
  Anomaly detection from graph data is an important data mining task in many applications such as social networks, finance, and e-commerce. We propose a novel framework, graph ANomaly dEtection framework with Multi-scale cONtrastive lEarning (ANEMONE in short) By using a graph neural network as a backbone to encode the information from multiple graph scales (views), we learn better representation for nodes in a graph.
  arXiv  Detail & Related papers  (2022-02-11T09:45:11Z)
• Deep Graph-level Anomaly Detection by Glocal Knowledge Distillation [61.39364567221311]
  Graph-level anomaly detection (GAD) describes the problem of detecting graphs that are abnormal in their structure and/or the features of their nodes. One of the challenges in GAD is to devise graph representations that enable the detection of both locally- and globally-anomalous graphs. We introduce a novel deep anomaly detection approach for GAD that learns rich global and local normal pattern information by joint random distillation of graph and node representations.
  arXiv  Detail & Related papers  (2021-12-19T05:04:53Z)
• Source Free Unsupervised Graph Domain Adaptation [60.901775859601685]
  Unsupervised Graph Domain Adaptation (UGDA) shows its practical value of reducing the labeling cost for node classification. Most existing UGDA methods heavily rely on the labeled graph in the source domain. In some real-world scenarios, the source graph is inaccessible because of privacy issues. We propose a novel scenario named Source Free Unsupervised Graph Domain Adaptation (SFUGDA)
  arXiv  Detail & Related papers  (2021-12-02T03:18:18Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.