Pith. sign in

REVIEW 1 cited by

Raising the Bar in Graph-level Anomaly Detection

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2205.13845 v1 pith:G5HRCVKZ submitted 2022-05-27 cs.LG cs.AI

classification cs.LGcs.AI
keywords detectionanomalylearningdeepexistinggraph-levelgraphsperformance
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Graph-level anomaly detection has become a critical topic in diverse areas, such as financial fraud detection and detecting anomalous activities in social networks. While most research has focused on anomaly detection for visual data such as images, where high detection accuracies have been obtained, existing deep learning approaches for graphs currently show considerably worse performance. This paper raises the bar on graph-level anomaly detection, i.e., the task of detecting abnormal graphs in a set of graphs. By drawing on ideas from self-supervised learning and transformation learning, we present a new deep learning approach that significantly improves existing deep one-class approaches by fixing some of their known problems, including hypersphere collapse and performance flip. Experiments on nine real-world data sets involving nine techniques reveal that our method achieves an average performance improvement of 11.8% AUC compared to the best existing approach.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. SpectralGap: Graph-Level Out-of-Distribution Detection via Laplacian Eigenvalue Gaps

    cs.LG 2025-05 conditional novelty 4.0 of 10

    SpecGap adjusts GNN features by subtracting the second-largest Laplacian eigenvector component times the spectral gap, claiming improved graph OOD detection without retraining.

Pith tools