Isolation-Based Anomaly Detection
Обнаружение аномалий на основе изоляции
2012-03-01
SCID: 54.1/87jwfdgw
Discuss with AI
Isolation Forestanomaly detectionone-class SVMsubsamplingswamping and masking
Figures from the paper
Abstract (AI)
Anomalies are data points that are few and different. As a result of these properties, we show that, anomalies are susceptible to a mechanism called isolation . This article proposes a method called Isolation Forest ( i Forest), which detects anomalies purely based on the concept of isolation without employing any distance or density measure---fundamentally different from all existing methods. As a result, i Forest is able to exploit subsampling (i) to achieve a low linear time-complexity and a small memory-requirement and (ii) to deal with the effects of swamping and masking effectively. Our empirical evaluation shows that i Forest outperforms ORCA, one-class SVM, LOF and Random Forests in terms of AUC, processing time, and it is robust against masking and swamping effects. i Forest also works well in high dimensional problems containing a large number of irrelevant attributes, and when anomalies are not available in training sample.
Key Findings
1
Empirical evaluations show that Isolation Forest outperforms ORCA, one-class SVM, LOF, and Random Forests in AUC and processing time.
2
Isolation Forest performs well in high-dimensional data with many irrelevant attributes and when anomalies are absent from the training sample.
3
Isolation Forest uses subsampling to achieve low linear time complexity and low memory requirements.
4
The method effectively addresses swamping and masking effects in anomaly detection.
5
The paper introduces Isolation Forest, an anomaly-detection method based solely on isolating observations, without distance or density measures.
Research Object
anomalies in data points
Research Subject
isolation-based anomaly detection performance, including computational efficiency, AUC, robustness to masking and swamping, and effectiveness in high-dimensional data
Publication Details
Publication Date
2012-03-01
Journal
Publisher
ISSN
Cited by
2573
Access Type
Author Information
Download PDF
Subscribe to digest