The DOI matches its Crossref record; 48 of the 48 references it cites were found in a registry or an index.
Isolation-Based Anomaly Detection
Abstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Breiman, L. (2001) · Machine Learning · doi:10.1023/a:1010933404324 · Cited by 133,538
UCI Machine Learning Repository
Asuncion, A. (2007) · Medical Entomology and Zoology · Cited by 25,410
David, F. N., & Tukey, J. W. (1977) · Biometrics · doi:10.2307/2529486 · Cited by 12,708
Chandola, V., Banerjee, A., & Kumar, V. (2009) · ACM Computing Surveys · doi:10.1145/1541880.1541882 · Cited by 11,687 · cited 3×
“Using basic distance measures, the basic assumption is that Normal point is close to its neighbors and anomaly is far from its neighbors [Chandola et al. 2009].”
BackgroundInfluential(2008) · Data Mining and Market Intelligence for Optimal Marketing Returns · doi:10.4324/9780080878096-12 · Cited by 6,954
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
Self-citationEstimating the Support of a High-Dimensional Distribution
Schölkopf, B., Platt, J. C., Shawe-Taylor, J., Smola, A. J., & Williamson, R. C. (2001) · Neural Computation · doi:10.1162/089976601750264965 · Cited by 6,168 · cited 2×
“The four state-of-the-art anomaly detectors used in experiments are ORCA [Bay and Schwabacher 2003], one-class SVM [Sch¨olkopf et al. 2001], LOF [Breunig et al. 2000] and Random Forests (RF) [Shi and Horvath 2006].”
MethodRobust Regression and Outlier Detection
Piepel, G. F. (1989) · Technometrics · doi:10.1080/00401706.1989.10488524 · Cited by 6,144
Robust Regression and Outlier Detection
Rousseeuw, P. J., & Leroy, A. M. (1987) · Wiley Series in Probability and Statistics · doi:10.1002/0471725382 · Cited by 5,609
LOF: identifying density-based local outliers
Breunig, M. M., Kriegel, H.-P., Ng, R. T., & Sander, J. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335388 · Cited by 5,207
Support Vector Data Description
Tax, D. M. J., & Duin, R. P. W. (2004) · Machine Learning · doi:10.1023/b:mach.0000008084.60811.49 · Cited by 3,512
ROCR: visualizing classifier performance in R
Sing, T., Sander, O., Beerenwinkel, N., & Lengauer, T. (2005) · Bioinformatics · doi:10.1093/bioinformatics/bti623 · Cited by 3,200
A Simple Generalisation of the Area Under the ROC Curve for Multiple Class Classification Problems
Hand, D. J., & Till, R. J. (2001) · Machine Learning · doi:10.1023/a:1010920819831 · Cited by 2,276
The Art of Computer Programming
Worlton, W. J. (1968) · Nuclear Science and Engineering · doi:10.13182/nse68-a19548 · Cited by 2,251
Tukey, J. W. (1977) · International Linear Collider · Cited by 2,155
Introduction to Data Mining, (First Edition)
Tan, P., Steinbach, M. S., & Kumar, V. (2005) · Addison-Wesley Longman Publishing Co., Inc. eBooks · Cited by 1,889
Efficient algorithms for mining outliers from large data sets
Ramaswamy, S., Rastogi, R., & Shim, K. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335437 · Cited by 1,860
Algorithms for Mining Distance-Based Outliers in Large Datasets
Knorr, E. M., & Ng, R. T. (1998) · Cited by 1,544
Distance-based outliers: algorithms and applications
Knorr, E. M., Ng, R. T., & Tucakov, V. (2000) · The VLDB Journal The International Journal on Very Large Data Bases · doi:10.1007/s007780050006 · Cited by 1,195 · cited 2×
“Examples are DB(p, D) [Knorr and Ng 1998; Knorr et al. 2000], Dk [Ramaswamy et al. 2000], ORCA [Bay and Schwabacher n 2003] and DOLPHIN [Angiulli and Fassetti 2009].”
BackgroundEfficient algorithms for mining outliers from large data sets
Ramaswamy, S., Rastogi, R., & Shim, K. (2000) · Proceedings of the 2000 ACM SIGMOD international conference on Management of data · doi:10.1145/342009.335437 · Cited by 1,171 · cited 2×
“2000], D n [Ramaswamy et al. 2000], ORCA [Bay and Schwabacher 2003] and DOLPHIN [Angiulli and Fassetti 2009].”
BackgroundDiscovering cluster-based local outliers
He, Z., Xu, X., & Deng, S. (2003) · Pattern Recognition Letters · doi:10.1016/s0167-8655(03)00003-5 · Cited by 1,055
Comparing measures of sample skewness and kurtosis
Joanes, D. N., & Gill, C. A. (1998) · Journal of the Royal Statistical Society: Series D (The Statistician) · doi:10.1111/1467-9884.00122 · Cited by 997
LOCI: fast outlier detection using the local correlation integral
Papadimitriou, S., Kitagawa, H., Gibbons, P. B., & Faloutsos, C. (2004) · Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405) · doi:10.1109/icde.2003.1260802 · Cited by 846
Proceedings 2002 IEEE International Conference on Data Mining. ICDM 2002
(2002) · 2002 IEEE International Conference on Data Mining, 2002. Proceedings. · doi:10.1109/icdm.2002.1183878 · Cited by 727
Feature bagging for outlier detection
Lazarevic, A., & Kumar, V. (2005) · Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining · doi:10.1145/1081870.1081891 · Cited by 656
Liu, R. Y., Parelius, J. M., & Singh, K. (1999) · The Annals of Statistics · doi:10.1214/aos/1018031260 · Cited by 651
Mining distance-based outliers in near linear time with randomization and a simple pruning rule
Bay, S. D., & Schwabacher, M. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956758 · Cited by 613
Enhancing Effectiveness of Outlier Detections for Low Density Patterns
Tang, J., Chen, Z., Fu, A. W.-C., & Cheung, D. W. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-47887-6_53 · Cited by 552
Unsupervised Learning With Random Forest Predictors
Shi, T., & Horvath, S. (2006) · Journal of Computational and Graphical Statistics · doi:10.1198/106186006x94072 · Cited by 539
Song, X., Wu, M., Jermaine, C., & Ranka, S. (2007) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2007.1009 · Cited by 374
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
Outlier detection by active learning
Abe, N., Zadrozny, B., & Langford, J. (2006) · Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1150402.1150459 · Cited by 322
A comparative study of RNN for outlier detection in data mining
Williams, G., Baxter, R., He, H., Hawkins, S., & Gu, L. (2003) · 2002 IEEE International Conference on Data Mining, 2002. Proceedings. · doi:10.1109/icdm.2002.1184035 · Cited by 277
Proceedings of the 10th IEEE International Conference on Data Mining (ICDM)
Webb, G. I., Liu, B., Zhang, C., Gunopulos, D., & Wu, X. (2010) · Cited by 247
On-line unsupervised outlier detection using finite mixtures with discounting learning algorithms
Yamanishi, K., Takeuchi, J.-I., Williams, G., & Milne, P. (2000) · Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/347090.347160 · Cited by 226
Data Structures and Algorithms with Object-Oriented Design Patterns in Java
Preiss, B. R. (1999) · Cited by 208
Computer programming as an art
Knuth, D. E. (2007) · ACM Turing award lectures · doi:10.1145/1283920.1283929 · Cited by 187
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
Self-citationDOLPHIN: An efficient algorithm for mining distance-based outliers in very large datasets
Angiulli, F., & Fassetti, F. (2009) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/1497577.1497581 · Cited by 104
LOADED: Link-Based Outlier and Anomaly Detection in Evolving Data Sets
Ghoting, A., Otey, M. E., & Parthasarathy, S. (2005) · Proceedings · doi:10.1109/icdm.2004.10011 · Cited by 83
Mining distance-based outliers from large databases in any metric space
Tao, Y., Xiao, X., & Zhou, S. (2006) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1150402.1150447 · Cited by 79
Outlier detection by sampling with accuracy guarantees
Wu, M., & Jermaine, C. (2006) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1150402.1150501 · Cited by 73
A Nonparametric Outlier Detection for Effectively Discovering Top-N Outliers from Engineering Data
Fan, H., Zai͏̈ane, O. R., Foss, A., & Wu, J. (2006) · Lecture notes in computer science · doi:10.1007/11731139_66 · Cited by 60
Very Fast Outlier Detection in Large Multidimensional Data Sets.
Chaudhary, A., Szalay, A. S., & Moore, A. (2002) · Cited by 48
(2009) · The SAGE Glossary of the Social and Behavioral Sciences · doi:10.4135/9781412972024.n967 · Cited by 30
ON TESTS FOR OUTLYING OBSERVATIONS
Pagurova, V. I., & Vere-Jones, D. (1987) · De Gruyter eBooks · doi:10.1515/9783112319086-089 · Cited by 29
A Unified Subspace Outlier Ensemble Framework for Outlier Detection
He, Z., Deng, S., & Xu, X. (2005) · Lecture notes in computer science · doi:10.1007/11563952_56 · Cited by 28
Filtering and Refinement: A Two-Stage Approach for Efficient and Effective Anomaly Detection
Yu, X. Y., Tang, L., & Han, J. (2009) · Proceedings · doi:10.1109/icdm.2009.44 · Cited by 28
Cited by
Deep Learning for Anomaly Detection: A Review
Pang, G., Shen, C., Cao, L., & Hengel, A. V. D. (2022) · ACM Computing Surveys · doi:10.1145/3439950 · Cited by 2,837
“t sophisticated anomalies are missed. Although a plethora of anomaly detection methods have been introduced over the years, the current state-ofthe-art methods, especially unsupervised methods (e.g., [17, 85]), still often incur high false positives on real-world datasets [20,116]. How to reduce false positives and en…”
BackgroundHierarchical Density Estimates for Data Clustering, Visualization, and Outlier Detection
Campello, R. J. G. B., Moulavi, D., Zimek, A., & Sander, J. (2015) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/2733381 · Cited by 915
“Let us note that some methods have been proposed to combine single outlier detectors into an ensemble [Lazarevic and Kumar 2005; Gao and Tan 2006; Nguyen et al. 2010; Kriegel et al. 2011a; Schubert et al. 2012; Liu et al. 2012; Zimek et al. 2013a, 2013, 2014].”
MethodAnomaly Detection for IoT Time-Series Data: A Survey
Cook, A. A., Misirli, G., & Fan, Z. (2020) · IEEE Internet of Things Journal · doi:10.1109/jiot.2019.2958185 · Cited by 790
On the evaluation of unsupervised outlier detection: measures, datasets, and an empirical study
Campos, G. O., Zimek, A., Sander, J., Campello, R. J. G. B., Micenková, B., Schubert, E., Assent, I., & Houle, M. E. (2016) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-015-0444-8 · Cited by 735
Himeur, Y., Ghanem, K., Alsalemi, A., Bensaali, F., & Amira, A. (2021) · Applied Energy · doi:10.1016/j.apenergy.2021.116601 · Cited by 660
Metadata
- Authors
- Liu, F. T., Ting, K. M., & Zhou, Z.-H.
- Venue
- ACM Transactions on Knowledge Discovery from Data
- Published
- 2012-03
- Volume
- 6
- Issue
- 1
- Pages
- 1-39
- ISSN
- 1556-4681 (ISSN-L)
- 1556-472X
- OpenAlex
- W1995443851
- Cited by
- 2,063
- References
- 48
- FWCI
- 9.50
- Type
- journal article
- Language
- en
- Open access
- closed
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.