Deep graph level anomaly detection with contrastive learning
Authors:
Top Cited Papers
Open Access
- 18 November 2022
- journal article
- research article
- Published by Springer Nature in Scientific Reports
- Vol. 12 (1) , 1-11
Abstract
Graph level anomaly detection (GLAD) aims to spot anomalous graphs that structure pattern and feature information are different from most normal graphs in a graph set, which is rarely studied by other researchers but has significant application value. For instance, GLAD can be used to distinguish some different characteristic molecules in drug discovery and chemical analysis. However, GLAD mainly faces the following three challenges: (1) learning more comprehensive graph level representations to differ normal graphs and abnormal graphs, (2) designing an effective graph anomaly evaluation paradigm to capture graph anomalies from the local and global graph perspectives, (3) overcoming the number imbalance problem of normal and abnormal graphs. In this paper, we combine graph neural networks and contrastive learning to build an end-to-end GLAD framework for solving the three challenges above. We aim to design a new graph level anomaly evaluation way, which first utilizes the contrastive learning strategy to enhance different level representations of normal graphs from node and graph levels by a graph convolution autoencoder with perturbed graph encoder. Then, we evaluate the error of them with corresponding representations of the generated reconstruction graph to detect anomalous graphs. Extensive experiments on ten real-world datasets from three areas, such as molecular, protein and social network anomaly graphs, show that our model can effectively detect graph level anomaly from the majority and outperform existing advanced methods.Keywords
Funding Information
- Australian Research Council (ARC) DECRA Project (DE200100964)
This publication has 33 references indexed in Scilit:
- Scalable Anomaly Ranking of Attributed Neighborhoods2016
- Propagation kernels: efficient graph kernels from propagated informationMachine Learning, 2015
- Focused clustering and outlier detection in large attributed graphs2014
- Local context selection for outlier ranking in graphs with multiple numeric node attributes2014
- Statistical Selection of Congruent Subspaces for Mining Attributed Graphs2013
- Ranking outlier nodes in subspaces of attributed graphs2013
- Graph Data Management and Mining: A Survey of Algorithms and Applications2010
- Protein function prediction via graph kernelsBioinformatics, 2005
- BRENDA, the enzyme database: updates and major new developmentsNucleic Acids Research, 2004
- The Protein Data BankNucleic Acids Research, 2000