Towards graph-level anomaly detection via deep evolutionary mapping

Xiaoxiao Ma, Jia Wu*, Jian Yang, Quan Z. Sheng

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionpeer-review

2 Citations (Scopus)

Abstract

Graph-level anomaly detection aims at capturing anomalous individual graphs in a graph set. Due to its significance in various real-world application fields, e.g., identifying rare molecules in chemistry and detecting potential frauds in online social networks, graph-level anomaly detection has received great attention recently. In distinction from node- and edge-level anomaly detection that is devoted to identifying anomalies on a single graph, graph-level anomaly detection faces more significant challenges because both the intra- and inter- graph structural and attribute patterns need to be taken into account to distinguish anomalies that exhibit deviating structures, rare attributes or the both. Although deep graph representation learning shows effectiveness in fusing high-level representations and capturing characters of individual graphs, most of the existing works are defective in graph-level anomaly detection because of their limited capability in exploring information across graphs, the imbalanced data distribution of anomalies, and low interpretability of the black-box graph neural networks (GNNs). To overcome these limitations, we propose a novel deep evolutionary graph mapping framework named GmapAD1, which can adaptively map each graph into a new feature space based on its similarity to a set of representative nodes chosen from the graph set. By automatically adjusting the candidate nodes using a specially designed evolutionary algorithm, anomalies and normal graphs are mapped to separate areas in the new feature space where a clear boundary between them can be learned. The selected candidate nodes can therefore be regarded as a benchmark for explaining anomalies because anomalies are more dissimilar/similar to the benchmark than normal graphs. Through our extensive experiments on nine real-world datasets, we demonstrate that exploring both intra- and inter- graph structural and attribute information is critical to spot anomalous graphs, and our method has achieved statistically significant improvements compared to the state of the art in terms of precision, recall, F1 score, and AUC.

Original languageEnglish
Title of host publicationKDD '23
Subtitle of host publicationproceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining
Place of PublicationNew York
PublisherAssociation for Computing Machinery
Pages1631-1642
Number of pages12
ISBN (Electronic)9798400701030
DOIs
Publication statusPublished - 2023
Event29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, KDD 2023 - Long Beach, United States
Duration: 6 Aug 202310 Aug 2023

Conference

Conference29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, KDD 2023
Country/TerritoryUnited States
CityLong Beach
Period6/08/2310/08/23

Keywords

  • Graph anomaly detection
  • anomaly detection
  • graph representation learning
  • differential evolution

Fingerprint

Dive into the research topics of 'Towards graph-level anomaly detection via deep evolutionary mapping'. Together they form a unique fingerprint.

Cite this