The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Extended Isolation Forest
Open accessAbstract
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 of the data to use hyperplanes with random slopes. This approach results in remedying the artifact seen in the anomaly score heat maps. We show that the robustness of the algorithm is much improved using this method by looking at the variance of scores of data points distributed along constant level sets. We report AUROC and AUPRC for our synthetic datasets, along with real-world benchmark datasets. We find no appreciable difference in the rate of convergence nor in computation time between the standard Isolation Forest and EIF.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Chandola, V., Banerjee, A., & Kumar, V. (2009) · ACM Computing Surveys · doi:10.1145/1541880.1541882 · Cited by 11,687
Liu, F. T., Ting, K. M., & Zhou, Z.-H. (2008) · 2008 Eighth IEEE International Conference on Data Mining · doi:10.1109/icdm.2008.17 · Cited by 6,601
Isolation-Based Anomaly Detection
Liu, F. T., Ting, K. M., & Zhou, Z.-H. (2012) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/2133360.2133363 · Cited by 2,063
Identification of Outliers in Multivariate Data
Rocke, D. M., & Woodruff, D. L. (1996) · Journal of the American Statistical Association · doi:10.1080/01621459.1996.10476975 · Cited by 360
Loda: Lightweight on-line detector of anomalies
Pevný, T. (2016) · Machine Learning · doi:10.1007/s10994-015-5521-0 · Cited by 357
Menze, B. H., Kelm, B. M., Splitthoff, D. N., Koethe, U., & Hamprecht, F. A. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-23783-6_29 · Cited by 212
Isolation‐based anomaly detection using nearest‐neighbor ensembles
Bandaragoda, T. R., Ting, K. M., Albrecht, D., Liu, F. T., Zhu, Y., & Wells, J. R. (2018) · Computational Intelligence · doi:10.1111/coin.12156 · Cited by 177
Incorporating Expert Feedback into Active Anomaly Discovery
Das, S., Wong, W., Dietterich, T. G., Fern, A., & Emmott, A. (2016) · Proceedings · doi:10.1109/icdm.2016.0102 · Cited by 154
On Detecting Clustered Anomalies Using SCiForest
Liu, F. T., Ting, K. M., & Zhou, Z. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-15883-4_18 · Cited by 138
Efficient Anomaly Detection by Isolation Using Nearest Neighbour Ensemble
Bandaragoda, T., Ting, K. M., Albrecht, D. W., Liu, F. T., & Wells, J. R. (2014) · IEEE ... International Conference on Data Mining workshops · doi:10.1109/icdmw.2014.70 · Cited by 84
Anomaly detection through on-line isolation Forest: An application to plasma etching
Susto, G. A., Beghi, A., & McLoone, S. (2017) · ASMC proceedings · doi:10.1109/asmc.2017.7969205 · Cited by 74
On decompositional algorithms for uniform sampling from n -spheres and n -balls
Harman, R., & Lacko, V. (2010) · Journal of Multivariate Analysis · doi:10.1016/j.jmva.2010.06.002 · Cited by 73
Anomaly Detection Using an Ensemble of Feature Models
Noto, K., Brodley, C., & Slonim, D. K. (2010) · Proceedings · doi:10.1109/icdm.2010.140 · Cited by 43
A Meta-Analysis of the Anomaly Detection Problem
Emmott, A., Das, S., Dietterich, T. G., et al. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1503.01158 · Cited by 29
Ordinal isolation: An efficient and effective intelligent outlier detection algorithm
Chen, G., Cai, Y., & Shi, J. (2011) · IEEE International Conference on Cyber Technology in Automation, Control, and Intelligent Systems · doi:10.1109/cyber.2011.6011757 · Cited by 7
Research works printed but not linked: 1
- 10.1145/3217880.3217883 · doi:10.1145/3217880.3217883
Cited by
Anomaly detection in time series: a comprehensive evaluation
Schmidl, S., Wenig, P., & Papenbrock, T. (2022) · Proceedings of the VLDB Endowment · doi:10.14778/3538598.3538602 · Cited by 590
Theissler, A., Pérez-Velázquez, J., Kettelgerdes, M., & Elger, G. (2021) · Reliability Engineering & System Safety · doi:10.1016/j.ress.2021.107864 · Cited by 581
Deep Isolation Forest for Anomaly Detection
Xu, H., Pang, G., Wang, Y., & Wang, Y. (2023) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2023.3270293 · Cited by 556
Generalized Isolation Forest for Anomaly Detection
Lesouple, J., Baudoin, C., Spigai, M., & Tourneret, J.-Y. (2021) · Pattern Recognition Letters · doi:10.1016/j.patrec.2021.05.022 · Cited by 202
Interpretable Anomaly Detection with DIFFI: Depth-based feature importance of Isolation Forest
Carletti, M., Terzi, M., & Susto, G. A. (2023) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2022.105730 · Cited by 118
Metadata
- Authors
- Hariri, S., Kind, M. C., & Brunner, R. J.
- Venue
- IEEE Transactions on Knowledge and Data Engineering
- Published
- 2021-04-01
- Volume
- 33
- Issue
- 4
- Pages
- 1479-1489
- ISSN
- 1041-4347 (ISSN-L)
- 1558-2191
- 2326-3865
- OpenAlex
- W2899638272
- Cited by
- 501
- References
- 15
- FWCI
- 15.54
- Type
- journal article
- Language
- en
- Open access
- hybrid
- Licence
- Funders
- National Science Foundation (AST 07-15036, AST 08-13543)
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.