Toward Supervised Anomaly Detection
This work addresses the need for improved anomaly detection in tasks like network security, offering a more efficient semi-supervised method, though it is incremental as it builds on existing paradigms.
The paper tackles the problem of anomaly detection by arguing that semi-supervised approaches should be based on unsupervised learning rather than supervised classifiers, and it proposes a novel algorithm that requires less labeled data while achieving higher detection accuracies in network intrusion detection.
Anomaly detection is being regarded as an unsupervised learning task as anomalies stem from adversarial or unlikely events with unknown distributions. However, the predictive performance of purely unsupervised anomaly detection often fails to match the required detection rates in many tasks and there exists a need for labeled data to guide the model generation. Our first contribution shows that classical semi-supervised approaches, originating from a supervised classifier, are inappropriate and hardly detect new and unknown anomalies. We argue that semi-supervised anomaly detection needs to ground on the unsupervised learning paradigm and devise a novel algorithm that meets this requirement. Although being intrinsically non-convex, we further show that the optimization problem has a convex equivalent under relatively mild assumptions. Additionally, we propose an active learning strategy to automatically filter candidates for labeling. In an empirical study on network intrusion detection data, we observe that the proposed learning methodology requires much less labeled data than the state-of-the-art, while achieving higher detection accuracies.