mlsanityData to 13 Oct 2026

Towards Cross-domain Few-shot Graph Anomaly Detection

arXiv 2410.08629 ↗First posted 11 Oct 2024cs.LGcited by 5

Not on the map. Why?

Abstract (arXiv)

Few-shot graph anomaly detection (GAD) has recently garnered increasing attention, which aims to discern anomalous patterns among abundant unlabeled test nodes under the guidance of a limited number of labeled training nodes. Existing few-shot GAD approaches typically adopt meta-training methods trained on richly labeled auxiliary networks to facilitate rapid adaptation to target networks that possess sparse labels. However, these proposed methods often assume that the auxiliary and target networks exist in the same data distributions-an assumption rarely holds in practical settings. This paper explores a more prevalent and complex scenario of cross-domain few-shot GAD, where the goal is to identify anomalies within sparsely labeled target graphs using auxiliary graphs from a related, yet distinct domain. The challenge here is nontrivial owing to inherent data distribution discrepancies between the source and target domains, compounded by the uncertainties of sparse labeling in the target domain. In this paper, we propose a simple and effective framework, termed CDFS-GAD, specifically designed to tackle the aforementioned challenges. CDFS-GAD first introduces a domain-adaptive graph contrastive learning module, which is aimed at enhancing cross-domain feature alignment. Then, a prompt tuning module is further designed to extract domain-specific features tailored to each domain. Moreover, a domain-adaptive hypersphere classification loss is proposed to enhance the discrimination between normal and anomalous instances under minimal supervision, utilizing domain-sensitive norms. Lastly, a self-training strategy is introduced to further refine the predicted scores, enhancing its reliability in few-shot settings. Extensive experiments on twelve real-world cross-domain data pairs demonstrate the effectiveness of the proposed CDFS-GAD framework in comparison to various existing GAD methods.

Key facts. Cited by 5 papers in the map (data through 13 Oct 2026). Builds on 26 of its 36 references that are in the map. First posted on arXiv 11 Oct 2024.

Builds on

26 of 36 references.

References · 26

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,093
  2. 2017Inductive Representation Learning on Large Graphscited by 6,303
  3. 2021Pre-train, Prompt, and Predict: A Systematic Survey of Prompting Methods in Natural Language Processingcited by 2,229
  4. 2018Deep Graph Infomaxcited by 1,104
  5. 2021Anomaly Detection on Attributed Networks via Contrastive Self-Supervised Learningcited by 176
  6. 2023GraphPrompt: Unifying Pre-Training and Downstream Tasks for Graph Neural Networkscited by 167
  7. 2020A Semi-supervised Graph Attentive Network for Financial Fraud Detectioncited by 150
  8. 2023All in One: Multi-task Prompting for Graph Neural Networkscited by 148
  9. 2022Universal Prompt Tuning for Graph Neural Networkscited by 100
  10. 2020AnomalyDAE: Dual autoencoder for anomaly detection on attributed networkscited by 81
  11. 2021Generative and Contrastive Self-Supervised Learning for Graph Anomaly Detectioncited by 67
  12. 2021Few-shot Network Anomaly Detection via Cross-network Meta-learningcited by 64
14 more
  1. 2022Graph Anomaly Detection via Multi-Scale Contrastive Learning Networks with Augmented Viewcited by 55
  2. 2023Virtual Node Tuning for Few-shot Node Classificationcited by 46
  3. 2020Rethinking Assumptions in Deep Anomaly Detectioncited by 45
  4. 2023GraphControl: Adding Conditional Control to Universal Graph Pre-trained Models for Graph Domain Transfer Learningcited by 32
  5. 2022Cross-Domain Graph Anomaly Detection via Anomaly-aware Contrastive Alignmentcited by 31
  6. 2022Reconstruction Enhanced Multi-View Contrastive Learning for Anomaly Detection on Attributed Networkscited by 28
  7. 2023SAD: Semi-Supervised Anomaly Detection on Dynamic Graphscited by 28
  8. 2023PREM: A Simple Yet Effective Approach for Node-Level Graph Anomaly Detectioncited by 25
  9. 2020Semi-supervised Anomaly Detection on Attributed Graphscited by 18
  10. 2022AntiBenford Subgraphs: Unsupervised Anomaly Detection in Financial Networkscited by 18
  11. 2022From Unsupervised to Few-shot Graph Anomaly Detection: A Multi-scale Contrastive Learning Approachcited by 13
  12. 2021Relevance-Aware Anomalous Users Detection in Social Network via Graph Neural Networkcited by 12
  13. 2023Few-shot Message-Enhanced Contrastive Learning for Graph Anomaly Detectioncited by 6
  14. 2023Towards Unsupervised Graph Completion Learning on Graphs with Features and Structure Missingcited by 1

Built on by

Cited by year (2026 to 13 Oct)

Citing papers per year: 2025: 4; 2026: 1.

5 papers.