Extended Isolation Forest
University of Illinois Urbana-Champaign · National Center for Supercomputing Applications
Abstract
We present an extension to the model-free anomaly detection algorithm, Isolation Forest. This extension, named Extended Isolation Forest (EIF), resolves issues with assignment of anomaly score to given data points. We motivate the problem using heat maps for anomaly scores. These maps suffer from artifacts generated by the criteria for branching operation of the binary tree. We explain this problem in detail and demonstrate the mechanism by which it occurs visually. We then propose two different approaches for improving the situation. First we propose transforming the data randomly before creation of each tree, which results in averaging out the bias. Second, which is the preferred way, is to allow the slicing…
Citation impact
- FWCI
- 19.89
- Percentile
- 100%
- References
- 18
Authors
3Topics & keywords
- Computer science
- Robustness (evolution)
- Hyperplane
- Anomaly detection
- Data mining
- Synthetic data
- Computation
- Algorithm
- Life in Land