Three Revisits to Node-Level Graph Anomaly Detection: Outliers, Message Passing and Hyperbolic Neural Networks

Jing Gu, Dongmian Zou
3/6/2024
cs.LG

No official code found. Best implementation: Jing-DS/HNN_GAD (4 stars, GPL-3.0, last commit 2024-02-20).

Abstract

Graph anomaly detection plays a vital role for identifying abnormal instances in complex networks. Despite advancements of methodology based on deep learning in recent years, existing benchmarking approaches exhibit limitations that hinder a comprehensive comparison. In this paper, we revisit datasets and approaches for unsupervised node-level graph anomaly detection tasks from three aspects. Firstly, we introduce outlier injection methods that create more diverse and graph-based anomalies in graph datasets. Secondly, we compare methods employing message passing against those without, uncovering the unexpected decline in performance associated with message passing. Thirdly, we explore the use of hyperbolic neural networks, specifying crucial architecture and loss design that contribute to enhanced performance. Through rigorous experiments and evaluations, our study sheds light on general strategies for improving node-level graph anomaly detection methods.

View on arXivView PDF

Code Implementations(1)

Jing-DS/HNN_GADCommunity100%
GPL-3.0
40PythonNov 27, 20232 years agoGPL-3.0

Similar Papers

Cite this paper

@article{gu2024three,
  title  = {Three Revisits to Node-Level Graph Anomaly Detection: Outliers, Message Passing and Hyperbolic Neural Networks},
  author = {Jing Gu and Dongmian Zou},
  year   = {2024},
  eprint = {2403.04010},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2403.04010v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2403.04010.svg)](https://codeofpaper.com/paper/2403.04010)

Discussion