FedCIGAR: A Personalized Reconstruction Approach for Federated Graph-level Anomaly Detection

• URL: http://arxiv.org/abs/2605.09428v1
• Date: Sun, 10 May 2026 09:03:54 GMT
• Title: FedCIGAR: A Personalized Reconstruction Approach for Federated Graph-level Anomaly Detection
• Abstract summary: We propose a novel Federated graph-level anomaly detection approach with Cluster-adaptIve GAted Reconstruction (FedCIGAR)<n>Specifically, we design a reconstruction-based paradigm trained on normal graphs to avoid synthetic data. Furthermore, we introduce a client-side node contribution gating mechanism and a server-side sliding window-based clustering strategy to tackle data heterogeneity.
• Score: 51.473064583839296
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Graph-level anomaly detection (GLAD) is crucial for ensuring the reliability of graph-driven applications by identifying abnormal graphs that deviate from the majority. Considering the privacy concerns in distributed scenarios, federated graph-level anomaly detection (FedGLAD) has emerged as a promising solution to enable collaborative detection without sharing raw data. However, existing methods suffer from poor generalization due to the reliance on unrealistic synthetic anomalies and insufficient personalization capabilities under data heterogeneity. To address these challenges, we propose a novel Federated graph-level anomaly detection approach with Cluster-adaptIve GAted Reconstruction (FedCIGAR). Specifically, we design a reconstruction-based paradigm trained on normal graphs to avoid synthetic data. Furthermore, we introduce a client-side node contribution gating mechanism and a server-side sliding window-based clustering strategy to tackle data heterogeneity. Extensive experiments demonstrate that FedCIGAR achieves superior performance and robustness in contrast to state-of-the-art methods.

Related papers

• Rethinking Feature Alignment in Generalist Graph Anomaly Detection: A Relational Fingerprint-based Approach [60.199985286210904]
  Generalist graph anomaly detection (GAD) aims to detect anomalies on unseen graphs without graph-specific retraining.<n>Existing approaches primarily focus on aligning heterogeneous data across domains, which ignores different feature semantics.<n>We propose Fingerprint-based generalist GAD approach (ReFi-GAD)<n>We show that ReFi-GAD significantly outperforms state-of-the-art methods in experiments on 14 datasets.
  arXiv  Detail & Related papers  (2026-05-25T05:12:26Z)
• 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)
• FreeGAD: A Training-Free yet Effective Approach for Graph Anomaly Detection [54.576802512108685]
  Graph Anomaly Detection (GAD) aims to identify nodes that deviate from the majority within a graph.<n>Existing approaches often suffer from high deployment costs and poor scalability due to their complex and resource-intensive training processes.<n>We propose FreeGAD, a novel training-free yet effective GAD method.
  arXiv  Detail & Related papers  (2025-08-14T12:37:20Z)
• Unsupervised Graph Anomaly Detection via Multi-Hypersphere Heterophilic Graph Learning [7.277472116667557]
  Graph Anomaly (GAD) plays a vital role in various data mining applications such as e-commerce fraud prevention and malicious user detection.<n>We propose a Heterophilic Graph Detection (HGE) module to learn distinguishable abnormal representations for potential anomalies.<n>Then, we propose a Multi-Hypersphere Learning (MHL) module to enhance the detection capability for context-dependent anomalies.
  arXiv  Detail & Related papers  (2025-03-15T08:08:13Z)
• A Label-Free Heterophily-Guided Approach for Unsupervised Graph Fraud Detection [60.09453163562244]
  We propose a Heterophily-guided Unsupervised Graph fraud dEtection approach (HUGE) for unsupervised GFD.<n>In the estimation module, we design a novel label-free heterophily metric called HALO, which captures the critical graph properties for GFD.<n>In the alignment-based fraud detection module, we develop a joint-GNN architecture with ranking loss and asymmetric alignment loss.
  arXiv  Detail & Related papers  (2025-02-18T22:07:36Z)
• UMGAD: Unsupervised Multiplex Graph Anomaly Detection [40.17829938834783]
  We propose a novel Unsupervised Multiplex Graph Anomaly Detection method, named UMGAD.<n>We first learn multi-relational correlations among nodes in multiplex heterogeneous graphs.<n>Then, to further extract abnormal information, we generate attribute-level and subgraph-level augmented-view graphs.
  arXiv  Detail & Related papers  (2024-11-19T15:15:45Z)
• ARC: A Generalist Graph Anomaly Detector with In-Context Learning [62.202323209244]
  ARC is a generalist GAD approach that enables a one-for-all'' GAD model to detect anomalies across various graph datasets on-the-fly.<n> equipped with in-context learning, ARC can directly extract dataset-specific patterns from the target dataset.<n>Extensive experiments on multiple benchmark datasets from various domains demonstrate the superior anomaly detection performance, efficiency, and generalizability of ARC.
  arXiv  Detail & Related papers  (2024-05-27T02:42:33Z)
• FGAD: Self-boosted Knowledge Distillation for An Effective Federated Graph Anomaly Detection Framework [33.62637380192881]
  Graph anomaly detection (GAD) aims to identify anomalous graphs that significantly deviate from other ones. Existing GAD methods usually execute with centralized training, which may lead to privacy leakage risk in some sensitive cases. We propose an effective federated graph anomaly detection framework (FGAD) to tackle these challenges.
  arXiv  Detail & Related papers  (2024-02-20T07:03:59Z)
• Byzantine-Robust Learning on Heterogeneous Data via Gradient Splitting [58.91947205027892]
  Federated learning has exhibited vulnerabilities to Byzantine attacks. Byzantine attackers can send arbitrary gradients to a central server to destroy the convergence and performance of the global model. A wealth of robust AGgregation Rules (AGRs) have been proposed to defend against Byzantine attacks.
  arXiv  Detail & Related papers  (2023-02-13T03:31:50Z)
• 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)

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.