A Probabilistic Approach to Uncovering Attributed Graph Anomalies [chapter]

Nan Li, Huan Sun, Kyle Chipman, Jemin George, Xifeng Yan
2014 Proceedings of the 2014 SIAM International Conference on Data Mining  
Uncovering subgraphs with an abnormal distribution of attributes reveals much insight into network behaviors. For example in social or communication networks, diseases or intrusions usually do not propagate uniformly, which makes it critical to find anomalous regions with high concentrations of a specific disease or intrusion. In this paper, we introduce a probabilistic model to identify anomalous subgraphs containing a significantly different percentage of a certain vertex attribute, such as a
more » ... specific disease or an intrusion, compared to the rest of the graph. Our framework, gAnomaly, models generative processes of vertex attributes and divides the graph into regions that are governed by background and anomaly processes. Two types of regularizers are employed to smoothen the regions and to facilitate vertex assignment. We utilize deterministic annealing EM to learn the model parameters, which is less initialization-dependent and better at avoiding local optima. In order to find fine-grained anomalies, an iterative procedure is further proposed. Experiments show gAnomaly outperforms a state-of-the-art algorithm at uncovering anomalous subgraphs in attributed graphs.
doi:10.1137/1.9781611973440.10 dblp:conf/sdm/LiSCGY14 fatcat:svkjuzia5bdathdxnxkokiafsy