Graph Local Homophily Network for Anomaly Detection
Open Access
- 21 October 2024
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 706-716
Abstract
In graph anomaly detection (GAD), the fact that anomalous nodes usually exhibit high heterophily, while most Graph Neural Networks (GNNs) have homophily assumptions, leads to poor performance. Many studies have attempted to solve this problem by employing a set of graph filters covering various frequencies. Their ultimate goal is to design the most appropriate spectral filter to capture the complex signals generated by normals and anomalies. The critical aspect lies in the fusion of information from filters with different frequency response functions. However, existing methods lack a clear indicator to guide the fusion of information at different frequencies. In this paper, we find that local homophily is a valuable metric for assessing the weights of high- and low-frequency information at the node level, and explicitly point out that the accuracy of local homophily is positively correlated with the accuracy of anomaly detection. Moreover, we unveil the phenomenon of camouflage in anomalous, wherein these nodes disguise themselves by making their features resemble those of surrounding normals. Based on this investigation, we propose the Graph Local Homophily Network for Anomaly Detection (GLHAD). Specifically, we first identify the local homophily of the nodes in the graph under the supervision of the labeled nodes, where two contrasting paradigms are employed to resist the camouflage of anomalies. Then, the local homophily-based combination module combines low- and high-frequency signals based on the predicted local homophily. Eventually, the node representations of different layers are aggregated to make finally predictions.Comprehensive experiments on four anomaly detection datasets show that GLHAD outperforms other state-of-the-art baselines.Keywords
Funding Information
- the Project of Science and Technology Research and Development Plan of China Railway Corporation (N2023J044)
This publication has 25 references indexed in Scilit:
- GCCAD: Graph Contrastive Learning for Anomaly DetectionIEEE Transactions on Knowledge and Data Engineering, 2022
- FRAUDRE: Fraud Detection Dual-Resistant to Graph Inconsistency and Imbalance2021
- A Comprehensive Survey on Graph Anomaly Detection With Deep LearningIEEE Transactions on Knowledge and Data Engineering, 2021
- A Synergistic Approach for Graph Anomaly Detection With Pattern Mining and Feature LearningIEEE Transactions on Neural Networks and Learning Systems, 2021
- Enhancing Graph Neural Network-based Fraud Detectors against Camouflaged Fraudsters2020
- FdGars: Fraudster Detection via Graph Convolutional Networks in Online App Review System2019
- Heterogeneous Graph Neural Networks for Malicious Account Detection2018
- Collective Opinion Spam Detection2015
- From amateurs to connoisseurs2013
- The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domainsIEEE Signal Processing Magazine, 2013