Multi-scale Anomaly Detection on Attributed Networks

Abstract

Many social and economic systems can be represented as attributed networks encoding the relations between entities who are themselves described by different node attributes. Finding anomalies in these systems is crucial for detecting abuses such as credit card frauds, web spams or network intrusions. Intuitively, anomalous nodes are defined as nodes whose attributes differ starkly from the attributes of a certain set of nodes of reference, called the context of the anomaly. While some methods have proposed to spot anomalies locally, globally or within a community context, the problem remain challenging due to the multi-scale composition of real networks and the heterogeneity of node metadata. Here, we propose a principled way to uncover outlier nodes simultaneously with the context with respect to which they are anomalous, at all relevant scales of the network. We characterize anomalous nodes in terms of the concentration retained for each node after smoothing specific signals localized on the vertices of the graph. Besides, we introduce a graph signal processing formulation of the Markov stability framework used in community detection, in order to find the context of anomalies. The performance of our method is assessed on synthetic and real-world attributed networks and shows superior results concerning state of the art algorithms. Finally, we show the scalability of our approach in large networks employing Chebychev polynomial approximations.

arXiv commentAccepted paper at the 34th AAAI Conference on Artificial Intelligence (AAAI-20), New York, US. 8 pages, 5 figures

References in corpus (8)

• Fast unfolding of communities in large networks
• Finding and evaluating community structure in networks
• The Emerging Field of Signal Processing on Graphs: Extending High-Dimensional Data Analysis to Networks and Other Irregular Domains
• Community detection algorithms: a comparative analysis
• Random Walks, Markov Processes and the Multiscale Modular Organization of Complex Networks
• Laplacian Dynamics and Multiscale Modular Structure in Networks
• Graph-based Anomaly Detection and Description: A Survey
• The stability of a graph partition: A dynamics-based framework for community detection

Cited by in corpus (7)

• A Comprehensive Survey on Graph Anomaly Detection with Deep Learning
• GAD-NR: Graph Anomaly Detection via Neighborhood Reconstruction
• Improving Generalizability of Graph Anomaly Detection Models via Data Augmentation
• Flow stability for dynamic community detection
• Unsupervised Graph Outlier Detection: Problem Revisit, New Insight, and Superior Method
• Hop-Count Based Self-Supervised Anomaly Detection on Attributed Networks
• Co-Membership-based Generic Anomalous Communities Detection