Anomalous Edge Detection in Edge Exchangeable Social Network Models
arXiv:2109.12727
Abstract
This paper studies detecting anomalous edges in directed graphs that model social networks. We exploit edge exchangeability as a criterion for distinguishing anomalous edges from normal edges. Then we present an anomaly detector based on conformal prediction theory; this detector has a guaranteed upper bound for false positive rate. In numerical experiments, we show that the proposed algorithm achieves superior performance to baseline methods.
References in corpus (12)
- A tutorial on conformal prediction
- Sparse graphs using exchangeable random measures
- Conformal Prediction: a Unified Review of Theory and New Challenges
- Hedging predictions in machine learning
- Plug-in martingales for testing exchangeability on-line
- Inductive Conformal Martingales for Change-Point Detection
- Conformal k-NN Anomaly Detector for Univariate Data Streams
- On edge exchangeable random graphs
- Exchangeable Variable Models
- Exchangeability, Conformal Prediction, and Rank Tests
- A Nonparametric Bayesian Model for Sparse Dynamic Multigraphs
- Sequential Edge Clustering in Temporal Multigraphs