MetaGAD: Learning to Meta Transfer for Few-shot Graph Anomaly Detection
- URL: http://arxiv.org/abs/2305.10668v1
- Date: Thu, 18 May 2023 03:04:51 GMT
- Title: MetaGAD: Learning to Meta Transfer for Few-shot Graph Anomaly Detection
- Authors: Xiongxiao Xu, Kaize Ding, Canyu Chen, Kai Shu
- Abstract summary: We propose a new framework MetaGAD to learn to meta-transfer the knowledge between unlabeled and labeled nodes for graph anomaly detection.
Experimental results on six real-world datasets demonstrate the effectiveness of the proposed approach.
- Score: 18.393760765481836
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Graph anomaly detection has long been an important problem in various domains
pertaining to information security such as financial fraud, social spam,
network intrusion, etc. The majority of existing methods are performed in an
unsupervised manner, as labeled anomalies in a large scale are often too
expensive to acquire. However, the identified anomalies may turn out to be data
noises or uninteresting data instances due to the lack of prior knowledge on
the anomalies. In realistic scenarios, it is often feasible to obtain limited
labeled anomalies, which have great potential to advance graph anomaly
detection. However, the work exploring limited labeled anomalies and a large
amount of unlabeled nodes in graphs to detect anomalies is rather limited.
Therefore, in this paper, we study a novel problem of few-shot graph anomaly
detection. We propose a new framework MetaGAD to learn to meta-transfer the
knowledge between unlabeled and labeled nodes for graph anomaly detection.
Experimental results on six real-world datasets with synthetic anomalies and
"organic" anomalies (available in the dataset) demonstrate the effectiveness of
the proposed approach in detecting anomalies with limited labeled anomalies.
Related papers
- 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) - Few-shot Message-Enhanced Contrastive Learning for Graph Anomaly
Detection [15.757864894708364]
Graph anomaly detection plays a crucial role in identifying exceptional instances in graph data that deviate significantly from the majority.
We propose a novel few-shot Graph Anomaly Detection model called FMGAD.
We show that FMGAD can achieve better performance than other state-of-the-art methods, regardless of artificially injected anomalies or domain-organic anomalies.
arXiv Detail & Related papers (2023-11-17T07:49:20Z) - Label-based Graph Augmentation with Metapath for Graph Anomaly Detection [8.090325400557697]
We present a new framework, Metapath-based Graph Anomaly Detection (MGAD), incorporating GCN layers in both the dual-encoders and decoders.
Through a comprehensive set of experiments conducted on seven real-world networks, this paper demonstrates the superiority of the MGAD method compared to state-of-the-art techniques.
arXiv Detail & Related papers (2023-08-21T05:41:05Z) - SAD: Semi-Supervised Anomaly Detection on Dynamic Graphs [11.819993729810257]
Anomaly detection aims to distinguish abnormal instances that deviate significantly from the majority of benign ones.
graph neural networks become increasingly popular in tackling the anomaly detection problem.
We present semi-supervised anomaly detection (SAD), an end-to-end framework for anomaly detection on dynamic graphs.
arXiv Detail & Related papers (2023-05-23T01:05:34Z) - Catching Both Gray and Black Swans: Open-set Supervised Anomaly
Detection [90.32910087103744]
A few labeled anomaly examples are often available in many real-world applications.
These anomaly examples provide valuable knowledge about the application-specific abnormality.
Those anomalies seen during training often do not illustrate every possible class of anomaly.
This paper tackles open-set supervised anomaly detection.
arXiv Detail & Related papers (2022-03-28T05:21:37Z) - From Unsupervised to Few-shot Graph Anomaly Detection: A Multi-scale
Contrastive Learning Approach [49.439021563395976]
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) - A Comprehensive Survey on Graph Anomaly Detection with Deep Learning [37.83120827837028]
Anomalies represent rare observations (e.g., data records or events) that are deviating significantly from others.
In this survey, we aim to provide a systematic and comprehensive review of the contemporary deep learning techniques for graph anomaly detection.
arXiv Detail & Related papers (2021-06-14T06:04:57Z) - Toward Deep Supervised Anomaly Detection: Reinforcement Learning from
Partially Labeled Anomaly Data [150.9270911031327]
We consider the problem of anomaly detection with a small set of partially labeled anomaly examples and a large-scale unlabeled dataset.
Existing related methods either exclusively fit the limited anomaly examples that typically do not span the entire set of anomalies, or proceed with unsupervised learning from the unlabeled data.
We propose here instead a deep reinforcement learning-based approach that enables an end-to-end optimization of the detection of both labeled and unlabeled anomalies.
arXiv Detail & Related papers (2020-09-15T03:05:39Z) - Deep Weakly-supervised Anomaly Detection [118.55172352231381]
Pairwise Relation prediction Network (PReNet) learns pairwise relation features and anomaly scores.
PReNet can detect any seen/unseen abnormalities that fit the learned pairwise abnormal patterns.
Empirical results on 12 real-world datasets show that PReNet significantly outperforms nine competing methods in detecting seen and unseen anomalies.
arXiv Detail & Related papers (2019-10-30T00:40:25Z)
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.