GCCAD: Graph Contrastive Coding for Anomaly Detection

被引:30
作者
Chen, Bo [1 ]
Zhang, Jing [2 ]
Zhang, Xiaokang [2 ]
Dong, Yuxiao [3 ]
Song, Jian [4 ]
Zhang, Peng [1 ]
Xu, Kaibo [5 ]
Kharlamov, Evgeny [6 ,7 ]
Tang, Jie [8 ]
机构
[1] Tsinghua Univ, Dept Comp Sci & Technol, Beijing 100084, Peoples R China
[2] Renmin Univ China, Informat Sch, Beijing 100872, Peoples R China
[3] Tsinghua Univ, Dept Comp Sci & Technol, Beijing 100084, Peoples R China
[4] Zhipu AI, Beijing 100084, Peoples R China
[5] Mininglamp Technol, Beijing 100084, Peoples R China
[6] Bosch Ctr Artificial Intelligence, D-71106 Renningen, Germany
[7] Univ Oslo, N-0315 Oslo, Norway
[8] Tsinghua Univ, Dept Comp Sci & Technol, Tsinghua Natl Lab Informat Sci & Technol TNList, Beijing 100084, Peoples R China
基金
美国国家科学基金会;
关键词
Graph neural network; anomaly detection; contrastive learning;
D O I
10.1109/TKDE.2022.3200459
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Graph-based anomaly detection has been widely used for detecting malicious activities in real-world applications. Existing attempts to address this problem have thus far focused on structural feature engineering or learning in the binary classification regime. In this work, we propose to leverage graph contrastive learning and present the supervised GCCAD model for contrasting abnormal nodes with normal ones in terms of their distances to the global context (e.g., the average of all nodes). To handle scenarios with scarce labels, we further enable GCCAD as a self-supervised framework by designing a graph corrupting strategy for generating synthetic node labels. To achieve the contrastive objective, we design a graph neural network encoder that can infer and further remove suspicious links during message passing, as well as learn the global context of the input graph. We conduct extensive experiments on four public datasets, demonstrating that 1) GCCAD significantly and consistently outperforms various advanced baselines and 2) its self-supervised version without fine-tuning can achieve comparable performance with its fully supervised version.
引用
收藏
页码:8037 / 8051
页数:15
相关论文
共 65 条
[1]   NONPARAMETRIC ESTIMATION OF ENTROPY FOR ABSOLUTELY CONTINUOUS DISTRIBUTIONS [J].
AHMAD, IA ;
LIN, PE .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1976, 22 (03) :372-375
[2]   Graph based anomaly detection and description: a survey [J].
Akoglu, Leman ;
Tong, Hanghang ;
Koutra, Danai .
DATA MINING AND KNOWLEDGE DISCOVERY, 2015, 29 (03) :626-688
[3]  
[Anonymous], 2011, ARXIV14090473
[4]  
[Anonymous], 2018, PROC INT C LEARN REP
[5]  
Bengio Y, 2013, Arxiv, DOI [arXiv:1308.3432, DOI 10.48550/ARXIV.1308.3432]
[6]  
Bian T, 2020, AAAI CONF ARTIF INTE, V34, P549
[7]   A Unifying Mutual Information View of Metric Learning: Cross-Entropy vs. Pairwise Losses [J].
Boudiaf, Malik ;
Rony, Jerome ;
Ziko, Imtiaz Masud ;
Granger, Eric ;
Pedersoli, Marco ;
Piantanida, Pablo ;
Ben Ayed, Ismail .
COMPUTER VISION - ECCV 2020, PT VI, 2020, 12351 :548-564
[8]  
Chen Ting, 2019, PMLR
[9]   Exploring Simple Siamese Representation Learning [J].
Chen, Xinlei ;
He, Kaiming .
2021 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION, CVPR 2021, 2021, :15745-15753
[10]   DETERRENT: Knowledge Guided Graph Attention Network for Detecting Healthcare Misinformation [J].
Cui, Limeng ;
Seo, Haeseung ;
Tabar, Maryam ;
Ma, Fenglong ;
Wang, Suhang ;
Lee, Dongwon .
KDD '20: PROCEEDINGS OF THE 26TH ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY & DATA MINING, 2020, :492-502