Graph anomaly detection based on hybrid node representation learning

Abstract

Anomaly detection on graph data has garnered significant interest from both the academia and industry. In recent years, fueled by the rapid development of Graph Neural Networks (GNNs), various GNNs-based anomaly detection methods have been proposed and achieved good results. However, GNNs-based methods assume that connected nodes have similar classes and features, leading to issues of class inconsistency and semantic inconsistency in graph anomaly detection. Existing methods have yet to adequately address these issues, thereby limiting the detection performance of the model. Therefore, an anomaly detection method that consists of one semantic fusion-based node representation module and one attention mechanism-based node representation module is proposed to resolve the aforementioned issues, respectively. The main highlights of the current study are outlined below: First, a novel framework is developed, aiming to better resolve the issues of class inconsistency and semantic inconsistency in graph anomaly detection. Second, we propose the semantic fusion-based node representation module which is based on Chebyshev polynomial graph filtering and is able to effectively capture high-frequency and low-frequency components of graph signals. Third, to overcome semantic inconsistency in graph data, we devise an attention mechanism-based node representation module which can adaptively learns importance information of graph nodes, resulting in significant improvement of the model performance. Finally, experiments are carried out on five real-world anomaly detection datasets, and the results show that the proposed method outperforms the state-of-the-art methods.