Anomaly Detection with Dual-Channel Heterogeneous Graph Neural Network Based on Hypersphere Dual Learning

被引:0
作者
Li, Qing [1 ]
Zhong, Jiang [2 ]
Ni, Hang [1 ]
机构
[1] School of Computer Science, Northwestern Polytechnical University, Shaanxi, Xi’an
[2] College of Computer Science, Chongqing University, Chongqing
来源
Tien Tzu Hsueh Pao/Acta Electronica Sinica | 2024年 / 52卷 / 07期
基金
中国国家自然科学基金;
关键词
dual learning; dual-channel graph neural network; graph anomaly detection; graph neural network; hypersphere learning; unsupervised learning;
D O I
10.12263/DZXB.20231106
中图分类号
学科分类号
摘要
Graph anomaly detection, as a crucial data mining task, focuses on identifying anomalous nodes that significantly deviate from the majority of the nodes. With the advancement of unsupervised graph neural network techniques, various efficient methods have been developed to detect potential anomalies in graph data, including those based on density estimation and generative adversarial networks. However, these methods often focus on generating high-quality representations for unsupervised graph anomaly detection and tend to overlook the characteristics of graph anomalies. Consequently, this paper proposes a dual-channel heterogeneous graph anomaly detection model (HD-GAD). Its architecture includes two graph neural networks, i.e. a global substructure-aware GNN (Graph Neural Network) and a local substructure-aware GNN, designed to capture global and local substructural properties for graph anomaly detection. Additionally, the model introduces a multi-hypersphere learning (MHL) objective based on dual inference, which measures anomalies deviating from the overall graph/community structure from macro and meso hypersphere perspectives. The HD-GAD model utilizes the similarity function EmbSim to optimize the training objective, mitigating model collapse issues in multi-hypersphere learning. Comprehensive experiments conducted on five different datasets demonstrated that the AUC (Area Under Curve) values exceeded 0.9 in most cases, achieving industry-leading levels and further proving the HD-GAD model's efficiency and performance advantages in graph anomaly detection tasks. © 2024 Chinese Institute of Electronics. All rights reserved.
引用
收藏
页码:2212 / 2218
页数:6
相关论文
共 19 条
  • [11] CHEN Z X, LIU B, WANG M Q, Et al., Generative adversarial attributed network anomaly detection, Proceedings of the 29th ACM International Conference on Information & Knowledge Management, pp. 1989-1992, (2020)
  • [12] WANG X H, JIN B H, DU Y, Et al., One-class graph neural networks for anomaly detection in attributed networks[J], Neural Computing and Applications, 33, 18, pp. 12073-12085, (2021)
  • [13] ZHOU S, TAN Q Y, XU Z M, Et al., Subtractive aggregation for attributed network anomaly detection, Proceedings of the 30th ACM International Conference on Information & Knowledge Management, pp. 3672-3676, (2021)
  • [14] MA X X, WU J, XUE S, Et al., A comprehensive survey on graph anomaly detection with deep learning, IEEE Transactions on Knowledge and Data Engineering, 35, 12, pp. 12012-12038, (2023)
  • [15] LIU K, DOU Y T, ZHAO Y, Et al., BOND: Benchmarking unsupervised outlier node detection on static attributed graphs, Advances in Neural Information Processing Systems, 35, pp. 27021-27035, (2022)
  • [16] LI K H, HUANG Z H., Noise filtering and feature enhancement based graph neural network method for fraud detection, Acta Electronica Sinica, 51, 11, pp. 3053-3060, (2023)
  • [17] XU X W, YURUK N, FENG Z D, Et al., SCAN: A structural clustering algorithm for networks, Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 824-833, (2007)
  • [18] LUO X X, WU J, BEHESHTI A, Et al., ComGA: Community-aware attributed graph anomaly detection, Proceedings of the Fifteenth ACM International Conference on Web Search and Data Mining, pp. 657-665, (2022)
  • [19] ZHOU S, HUANG X, LIU N H, Et al., Unseen anomaly detection on networks via multi-hypersphere learning, Proceedings of the 2022 SIAM International Conference on Data Mining (SDM), pp. 262-270, (2022)