Mining distance-based outliers in near linear time with randomization and a simple pruning rule
Open accessThe DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Abstract
Defining outliers by their distance to neighboring examples is a popular approach to finding unusual examples in a data set. Recently, much work has been conducted with the goal of finding fast algorithms for this task. We show that a simple nested loop algorithm that in the worst case is quadratic can give near linear time performance when the data is in random order and a simple pruning rule is used. We test our algorithm on real high-dimensional data sets with millions of examples and show that the near linear scaling holds over several orders of magnitude. Our average case analysis suggests that much of the efficiency is because the time to process non-outliers, which are the majority of examples, does not depend on the size of the data set.
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
Multidimensional binary search trees used for associative searching
Bentley, J. L. (1975) · Communications of the ACM · doi:10.1145/361002.361007 · Cited by 7,520
R-trees: a dynamic index structure for spatial searching
Guttman, A. (1984) · Proceedings of the 1984 ACM SIGMOD international conference on Management of data - SIGMOD '84 · doi:10.1145/602259.602266 · Cited by 6,580
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
LOF: identifying density-based local outliers
Breunig, M. M., Kriegel, H.-P., Ng, R. T., & Sander, J. (2000) · Proceedings of the 2000 ACM SIGMOD international conference on Management of data · doi:10.1145/342009.335388 · Cited by 4,149 · cited 1×
“[8] used a variant of the X-tree to do nearest neighbor search and found that the index only worked well for low dimensions, less than 5, and performance dramatically worsened for just 10 or 20 dimensions.”
MethodHawkins, D. M. (1980) · doi:10.1007/978-94-015-3994-4 · Cited by 2,982
Barnett, V., Lewis, T., & Abeles, F. (1979) · Physics Today · doi:10.1063/1.2995737 · Cited by 2,824
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
Atkinson, A., Barnett, V., & Lewis, T. (1995) · Journal of the Royal Statistical Society. Series A (Statistics in Society) · doi:10.2307/2983451 · Cited by 1,682
Integrated Public Use Microdata Series
Ruggles, S., Genadek, K., Goeken, R., Grover, J., & Sobek, M. (2015) · Institute for Social Research and Data Innovation · doi:10.18128/d010.v6.0 · Cited by 1,485
Statistical Fraud Detection: A Review
Bolton, R. J., & Hand, D. J. (2002) · Statistical Science · doi:10.1214/ss/1042727940 · Cited by 1,450
Cited by
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
“In the first exper-iment we compare iForest with ORCA [3], LOF [6] and Random Forests (RF) [12].”
MethodIsolation-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
Detecting Spacecraft Anomalies Using LSTMs and Nonparametric Dynamic Thresholding
Hundman, K., Constantinou, V., Laporte, C., Colwell, I., & Soderstrom, T. (2018) · Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3219819.3219845 · Cited by 1,771
Pimentel, M. A. F., Clifton, D. A., Clifton, L., & Tarassenko, L. (2014) · Signal Processing · doi:10.1016/j.sigpro.2013.12.026 · Cited by 1,649
Hierarchical 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
A survey on unsupervised outlier detection in high‐dimensional numerical data
Zimek, A., Schubert, E., & Kriegel, H. (2012) · Statistical Analysis and Data Mining The ASA Data Science Journal · doi:10.1002/sam.11161 · Cited by 864
Angle-based outlier detection in high-dimensional data
Kriegel, H.-P., Schubert, M., & Zimek, A. (2008) · Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1401890.1401946 · Cited by 828
Anomaly 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
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
Classification and Novel Class Detection in Concept-Drifting Data Streams under Time Constraints
Masud, M., Gao, J., Khan, L., Han, J., & Thuraisingham, B. M. (2011) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2010.61 · Cited by 400
AdaBoost-Based Algorithm for Network Intrusion Detection
Hu, W., Hu, W., & Maybank, S. (2008) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2007.914695 · Cited by 394
Sensor-Based Abnormal Human-Activity Detection
Yin, J., Yang, Q., & Pan, J. J. (2008) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2007.1042 · Cited by 391
Incremental Local Outlier Detection for Data Streams
Pokrajac, D., Lazarevic, A., & Latecki, L. J. (2007) · 2007 IEEE Symposium on Computational Intelligence and Data Mining · doi:10.1109/cidm.2007.368917 · Cited by 386
HiCS: High Contrast Subspaces for Density-Based Outlier Ranking
Keller, F., Muller, E., & Bohm, K. (2012) · 2012 IEEE 28th International Conference on Data Engineering · doi:10.1109/icde.2012.88 · Cited by 373
Loda: Lightweight on-line detector of anomalies
Pevný, T. (2016) · Machine Learning · doi:10.1007/s10994-015-5521-0 · Cited by 357
Schubert, E., Zimek, A., & Kriegel, H.-P. (2014) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-012-0300-z · Cited by 300
Distance-based detection and prediction of outliers
Angiulli, F., Basta, S., & Pizzuti, C. (2006) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2006.29 · Cited by 291
Outlier Detection with Kernel Density Functions
Latecki, L. J., Lazarevic, A., & Pokrajac, D. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-73499-4_6 · Cited by 273
Interpreting and Unifying Outlier Scores
Kriegel, H.-P., Kroger, P., Schubert, E., & Zimek, A. (2011) · Proceedings of the 2011 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972818.2 · Cited by 266
A comprehensive survey of numeric and symbolic outlier mining techniques
Agyemang, M., Barker, K., & Alhajj, R. (2006) · Intelligent Data Analysis · doi:10.3233/ida-2006-10604 · Cited by 164
“To address this problem, Bay and Schwabacher [22] modify the original nested loop algorithm to yield near linear time complexity in conjunction with randomization and simple basic pruning.”
Hassanien, A. E., Darwish, A., & Abdelghafar, S. (2020) · Artificial Intelligence Review · doi:10.1007/s10462-019-09760-1 · Cited by 84
Mining class outliers: concepts, algorithms and applications in CRM
He, Z., Xu, X., Huang, J. Z., & Deng, S. (2004) · Expert Systems with Applications · doi:10.1016/j.eswa.2004.07.002 · Cited by 79
Data Mining Applications for Space Mission Operations System Health Monitoring
Iverson, D. (2008) · SpaceOps 2008 Conference · doi:10.2514/6.2008-3212 · Cited by 40
Metadata
- Authors
- Bay, S. D., & Schwabacher, M.
- Venue
- Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
- Publisher
- ACM
- Published
- 2003-08-24
- Pages
- 29-38
- OpenAlex
- W2124536999
- Cited by
- 613
- References
- 24
- FWCI
- 13.50
- Type
- conference paper
- Language
- en
- Open access
- green
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.