The DOI matches its Crossref record; 41 of the 41 references it cites were found in a registry or an index.
Angle-based outlier detection in high-dimensional data
Abstract
Detecting outliers in a large set of data objects is a major data mining task aiming at finding different mechanisms responsible for different groups of objects in a data set. All existing approaches, however, are based on an assessment of distances (sometimes indirectly by assuming certain distributions) in the full-dimensional Euclidean data space. In high-dimensional data, these approaches are bound to deteriorate due to the notorious "curse of dimensionality". In this paper, we propose a novel approach named ABOD (Angle-Based Outlier Detection) and some variants assessing the variance in the angles between the difference vectors of a point to the other points. This way, the effects of the "curse of dimensionality" are alleviated compared to purely distance-based approaches. A main advantage of our new approach is that our method does not rely on any parameter selection influencing the quality of the achieved ranking. In a thorough experimental evaluation, we compare ABOD to the well-established distance-based method LOF for various artificial and a real world data set and show ABOD to perform especially well on high-dimensional data.
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
David, F. N., & Tukey, J. W. (1977) · Biometrics · doi:10.2307/2529486 · Cited by 12,708
UCI Repository of machine learning databases
Blake, C. L. (1998) · Medical Entomology and Zoology · Cited by 10,582
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
Self-citationLOF: 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
Self-citationHawkins, 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
A Fast Algorithm for the Minimum Covariance Determinant Estimator
Rousseeuw, P. J., & Driessen, K. V. (1999) · Technometrics · doi:10.1080/00401706.1999.10485670 · Cited by 2,708
Fei-Fei, L., Fergus, R., & Perona, P. (2005) · 2004 Conference on Computer Vision and Pattern Recognition Workshop · doi:10.1109/cvpr.2004.383 · Cited by 2,502
When Is ''Nearest Neighbor'' Meaningful?
Beyer, K., Goldstein, J., Ramakrishnan, R., & Shaft, U. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-49257-7_15 · Cited by 2,403
Tukey, J. W. (1977) · International Linear Collider · Cited by 2,155
On the Surprising Behavior of Distance Metrics in High Dimensional Space
Aggarwal, C. C., Hinneburg, A., & Keim, D. A. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44503-x_27 · Cited by 2,083
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
Algorithms for Mining Distance-Based Outliers in Large Datasets
Knorr, E. M., & Ng, R. T. (1998) · Cited by 1,544
Birch, J. B., & Tukey, J. W. (1978) · Journal of the American Statistical Association · doi:10.2307/2286300 · Cited by 1,440
Balakrishnan, N., Barnett, V., & Lewis, T. (1995) · Biometrics · doi:10.2307/2533352 · Cited by 1,217
Efficient 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
Outlier detection for high dimensional data
Aggarwal, C. C., & Yu, P. S. (2001) · Proceedings of the 2001 ACM SIGMOD international conference on Management of data · doi:10.1145/375663.375668 · Cited by 1,029
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
Fast Outlier Detection in High Dimensional Spaces
Angiulli, F., & Pizzuti, C. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45681-3_2 · Cited by 836
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
What Is the Nearest Neighbor in High Dimensional Spaces
Hinneburg, A., Aggarwal, C. C., & Keim, D. A. (2000) · KOPS (University of Konstanz) · Cited by 505
On-Line Unsupervised Outlier Detection Using Finite Mixtures with Discounting Learning Algorithms
Yamanishi, K., Takeuchi, J.-I., Williams, G., & Milne, P. (2004) · Data Mining and Knowledge Discovery · doi:10.1023/b:dami.0000023676.72185.7c · Cited by 476
A survey of kernels for structured data
Gärtner, T. (2003) · ACM SIGKDD Explorations Newsletter · doi:10.1145/959242.959248 · Cited by 452
Barnett, V., & Lewis, T. (1974) · Cited by 445
Finding Intensional Knowledge of Distance-Based Outliers
Knorr, E. M., & Ng, R. T. (1999) · Cited by 423
Ranking Outliers Using Symmetric Neighborhood Relationship
Jin, W., Tung, A. K. H., Han, J., & Wang, W. (2006) · Lecture Notes in Computer Science · doi:10.1007/11731139_68 · Cited by 415
A Linear Method for Deviation Detection in Large Databases
Arning, A., Agrawal, R., & Raghavan, P. (1996) · Cited by 363
Discovery-driven exploration of OLAP data cubes
Sarawagi, S., Agrawal, R., & Megiddo, N. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0100984 · Cited by 332
Mining top-n local outliers in large databases
Jin, W., Tung, A. K. H., & Han, J. (2001) · Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/502512.502554 · Cited by 328
Computing depth contours of bivariate point clouds
Ruts, I., & Rousseeuw, P. J. (1996) · Computational Statistics & Data Analysis · doi:10.1016/s0167-9473(96)00027-8 · Cited by 263
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
Efficient biased sampling for approximate clustering and outlier detection in large data sets
Kollios, G., Gunopulos, D., Koudas, N., & Berchtold, S. (2003) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2003.1232271 · Cited by 205
Fast computation of 2-dimensional depth contours
Johnson, T. L., Kwok, I. O., & Ng, R. T. (1998) · Cited by 190
Sun, P., & Chawla, S. (2005) · Proceedings · doi:10.1109/icdm.2004.10097 · Cited by 116
Yamanishi, K., & Takeuchi, J. (2001) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/502512.502570 · Cited by 104
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
A unified approach for mining outliers
Knorr, E. M., & Ng, R. T. (1997) · Cited by 57
An Efficient Reference-Based Approach to Outlier Detection in Large Datasets
Pei, Y., Zai͏̈ane, O. R., & Gao, Y. C. (2006) · Proceedings · doi:10.1109/icdm.2006.17 · Cited by 50
Example-Based Robust Outlier Detection in High Dimensional Datasets
Zhu, C., Kitagawa, H., & Faloutsos, C. (2006) · Proceedings · doi:10.1109/icdm.2005.59 · Cited by 48
Cited by
MAD-GAN: Multivariate Anomaly Detection for Time Series Data with Generative Adversarial Networks
Li, D., Chen, D., Jin, B., Shi, L., Goh, J., & Ng, S.-K. (2019) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-30490-4_56 · Cited by 1,185
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
“Recent global approaches base the decision not on Euclidean distances but on anglevariance (ABOD [Kriegel et al. 2008] and an efficient variant using random projections [Pham and Pagh 2012]).”
MethodSelf-citationA 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
Self-citationOn 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
Self-citationA Review on Soft Sensors for Monitoring, Control, and Optimization of Industrial Processes
Jiang, Y., Yin, S., Dong, J., & Kaynak, O. (2021) · IEEE Sensors Journal · doi:10.1109/jsen.2020.3033153 · Cited by 667
Metadata
- Authors
- Kriegel, H.-P., Schubert, M., & Zimek, A.
- Venue
- Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
- Publisher
- ACM
- Published
- 2008-08-24
- Pages
- 444-452
- OpenAlex
- W1986332411
- Cited by
- 828
- References
- 41
- FWCI
- 6.70
- Type
- conference paper
- 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.