Rethinking Feature Alignment in Generalist Graph Anomaly Detection: A Relational Fingerprint-based Approach
- URL: http://arxiv.org/abs/2605.25429v1
- Date: Mon, 25 May 2026 05:12:26 GMT
- Title: Rethinking Feature Alignment in Generalist Graph Anomaly Detection: A Relational Fingerprint-based Approach
- Abstract summary: 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.
- Score: 60.199985286210904
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Generalist graph anomaly detection (GAD) aims to detect anomalies on unseen graphs without graph-specific retraining. Nevertheless, existing approaches primarily focus on aligning heterogeneous features across different data domains via PCA-based projection, which harmonizes feature dimensions ignores feature semantics. As a result, GAD models fail to learn transferable semantic knowledge, and even exhibit negative transfer on unseen graphs. To address this issue, we propose a Relational Fingerprint-based generalist GAD approach (ReFi-GAD for short), aligning heterogeneous raw features with a universal and semantics-aware Relational Fingerprint (ReFi) that encodes anomaly-indicative cues from both contextual and structural perspectives. Building on ReFi, we design a fingerprint-grounded generalist GAD model, which combines a transformer-based encoder to capture domain-invariant knowledge with an SNR-guided refinement module for domain-specific adaptation. Extensive experiments on 14 datasets demonstrate that ReFi-GAD significantly outperforms state-of-the-art methods.
Related papers
- FedCIGAR: A Personalized Reconstruction Approach for Federated Graph-level Anomaly Detection [51.473064583839296]
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.
arXiv Detail & Related papers (2026-05-10T09:03:54Z) - Evolutionary Router Feature Generation for Zero-Shot Graph Anomaly Detection with Mixture-of-Experts [60.60414602796664]
We propose a novel MoE framework with evolutionary router feature generation (EvoFG) for zero-shot GAD.<n>EvoFG consistently outperforms state-of-the-art baselines, achieving strong and stable zero-shot GAD performance.
arXiv Detail & Related papers (2026-02-12T06:16:51Z) - Zero-shot Generalizable Graph Anomaly Detection with Mixture of Riemannian Experts [33.295461492913354]
Graph Anomaly Detection (GAD) aims to identify irregular patterns in graph data.<n>Existing zero-shot GAD methods largely ignore intrinsic geometric differences across diverse anomaly patterns.<n>We propose GAD-MoRE, a novel framework for zero-shot Generalizable Graph Anomaly Detection.
arXiv Detail & Related papers (2026-02-06T16:46:30Z) - OWLEYE: Zero-Shot Learner for Cross-Domain Graph Data Anomaly Detection [48.77471686671269]
OWLEYE is a novel framework that learns transferable patterns of normal behavior from multiple graphs.<n>We show that OWLEYE achieves superior performance and generalizability compared to state-of-the-art baselines.
arXiv Detail & Related papers (2026-01-27T02:08:18Z) - GAD-NR: Graph Anomaly Detection via Neighborhood Reconstruction [34.82023223790515]
Graph Auto-Encoders (GAEs) encode graph data into node representations and identify anomalies by assessing the reconstruction quality of the graphs based on these representations.<n>We propose GAD-NR, a new variant of GAE that incorporates neighborhood reconstruction for graph anomaly detection.<n>Extensive experimentation conducted on six real-world datasets validates the effectiveness of GAD-NR, showcasing significant improvements (by up to 30% in AUC) over state-of-the-art competitors.
arXiv Detail & Related papers (2023-06-02T23:23:34Z) - Relation Matters: Foreground-aware Graph-based Relational Reasoning for
Domain Adaptive Object Detection [81.07378219410182]
We propose a new and general framework for DomainD, named Foreground-aware Graph-based Reasoning (FGRR)
FGRR incorporates graph structures into the detection pipeline to explicitly model the intra- and inter-domain foreground object relations.
Empirical results demonstrate that the proposed FGRR exceeds the state-of-the-art on four DomainD benchmarks.
arXiv Detail & Related papers (2022-06-06T05:12:48Z) - Self-Guided Adaptation: Progressive Representation Alignment for Domain
Adaptive Object Detection [86.69077525494106]
Unsupervised domain adaptation (UDA) has achieved unprecedented success in improving the cross-domain robustness of object detection models.
Existing UDA methods largely ignore the instantaneous data distribution during model learning, which could deteriorate the feature representation given large domain shift.
We propose a Self-Guided Adaptation (SGA) model, target at aligning feature representation and transferring object detection models across domains.
arXiv Detail & Related papers (2020-03-19T13:30:45Z)
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.