Saved in:
Bibliographic Details
Main Authors: Zeng, Guolei, Qiao, Hezhe, Ai, Guoguo, Guo, Jinsong, Pang, Guansong
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2510.02014
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866912865392263168
author Zeng, Guolei
Qiao, Hezhe
Ai, Guoguo
Guo, Jinsong
Pang, Guansong
author_facet Zeng, Guolei
Qiao, Hezhe
Ai, Guoguo
Guo, Jinsong
Pang, Guansong
contents Graph anomaly detection (GAD) has attracted growing interest for its crucial ability to uncover irregular patterns in broad applications. Semi-supervised GAD, which assumes a subset of annotated normal nodes available during training, is among the most widely explored application settings. However, the normality learned by existing semi-supervised GAD methods is limited to the labeled normal nodes, often inclining to overfitting the given patterns. These can lead to high detection errors, such as high false positives. To overcome this limitation, we propose GraphNC , a graph normality calibration framework that leverages both labeled and unlabeled data to calibrate the normality from a teacher model (a pre-trained semi-supervised GAD model) jointly in anomaly score and node representation spaces. GraphNC includes two main components, anomaly score distribution alignment (ScoreDA) and perturbation-based normality regularization (NormReg). ScoreDA optimizes the anomaly scores of our model by aligning them with the score distribution yielded by the teacher model. Due to accurate scores in most of the normal nodes and part of the anomaly nodes in the teacher model, the score alignment effectively pulls the anomaly scores of the normal and abnormal classes toward the two ends, resulting in more separable anomaly scores. Nevertheless, there are inaccurate scores from the teacher model. To mitigate the misleading by these scores, NormReg is designed to regularize the graph normality in the representation space, making the representations of normal nodes more compact by minimizing a perturbation-guided consistency loss solely on the labeled nodes.
format Preprint
id arxiv_https___arxiv_org_abs_2510_02014
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Normality Calibration in Semi-supervised Graph Anomaly Detection
Zeng, Guolei
Qiao, Hezhe
Ai, Guoguo
Guo, Jinsong
Pang, Guansong
Machine Learning
Graph anomaly detection (GAD) has attracted growing interest for its crucial ability to uncover irregular patterns in broad applications. Semi-supervised GAD, which assumes a subset of annotated normal nodes available during training, is among the most widely explored application settings. However, the normality learned by existing semi-supervised GAD methods is limited to the labeled normal nodes, often inclining to overfitting the given patterns. These can lead to high detection errors, such as high false positives. To overcome this limitation, we propose GraphNC , a graph normality calibration framework that leverages both labeled and unlabeled data to calibrate the normality from a teacher model (a pre-trained semi-supervised GAD model) jointly in anomaly score and node representation spaces. GraphNC includes two main components, anomaly score distribution alignment (ScoreDA) and perturbation-based normality regularization (NormReg). ScoreDA optimizes the anomaly scores of our model by aligning them with the score distribution yielded by the teacher model. Due to accurate scores in most of the normal nodes and part of the anomaly nodes in the teacher model, the score alignment effectively pulls the anomaly scores of the normal and abnormal classes toward the two ends, resulting in more separable anomaly scores. Nevertheless, there are inaccurate scores from the teacher model. To mitigate the misleading by these scores, NormReg is designed to regularize the graph normality in the representation space, making the representations of normal nodes more compact by minimizing a perturbation-guided consistency loss solely on the labeled nodes.
title Normality Calibration in Semi-supervised Graph Anomaly Detection
topic Machine Learning
url https://arxiv.org/abs/2510.02014