The DOI matches its Crossref record; 39 of the 39 references it cites were found in a registry or an index.
Feature bagging for outlier detection
Abstract
Outlier detection has recently become an important problem in many industrial and financial applications. In this paper, a novel feature bagging approach for detecting outliers in very large, high dimensional and noisy databases is proposed. It combines results from multiple outlier detection algorithms that are applied using different set of features. Every outlier detection algorithm uses a small subset of features that are randomly selected from the original feature set. As a result, each outlier detector identifies different outliers, and thus assigns to all data records outlier scores that correspond to their probability of being outliers. The outlier scores computed by the individual outlier detection algorithms are then combined in order to find the better quality outliers. Experiments performed on several synthetic and real life data sets show that the proposed methods for combining outputs from multiple outlier detection algorithms provide non-trivial improvements over the base algorithm.
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. (1996) · Machine Learning · doi:10.1007/bf00058655 · Cited by 16,325 · cited 3×
“bagging [9], boosting [14]) or the class labels (e.”
BackgroundMethodProceedings of the 24th international conference on Machine learning
(2007) · doi:10.1145/1273496 · Cited by 11,630
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
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
Barnett, V., Lewis, T., & Abeles, F. (1979) · Physics Today · doi:10.1063/1.2995737 · Cited by 2,824
Automatic subspace clustering of high dimensional data for data mining applications
Agrawal, R., Gehrke, J., Gunopulos, D., & Raghavan, P. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276314 · Cited by 2,412
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 · cited 1×
“In fact, due to the sparse nature of distance distributions in high dimensional spaces, the distances between any pair of data records may become quite similar [6].”
BackgroundEfficient 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
SMOTEBoost: Improving Prediction of the Minority Class in Boosting
Chawla, N. V., Lazarevic, A., Hall, L. O., & Bowyer, K. W. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-39804-2_12 · Cited by 1,668
Self-citationAlgorithms for Mining Distance-Based Outliers in Large Datasets
Knorr, E. M., & Ng, R. T. (1998) · Cited by 1,544
Novelty detection: a review—part 1: statistical approaches
Markou, M., & Singh, S. (2003) · Signal Processing · doi:10.1016/j.sigpro.2003.07.018 · Cited by 1,432
Robust classification for imprecise environments
Provost, F., & Fawcett, T. (2001) · Machine Learning · doi:10.1023/a:1007601015854 · Cited by 1,250 · cited 1×
“Outlier detection algorithms are typically evaluated using the detection rate, the false alarm rate, and the ROC curves [26].”
MethodBalakrishnan, 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 · cited 4×
“Several recently proposed distance based outlier detection algorithms are based on (1) computing the full dimensional distances of points from one another using all the available features [19, 27] or only feature projections [3], and (2) on computing the densities of local neighborhoods [10].”
BackgroundInfluential(2000) · CrossRef Listing of Deleted DOIs · doi:10.1162/153244303321897735 · Cited by 1,092
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
A Comparative Study of Anomaly Detection Schemes in Network Intrusion Detection
Lazarevic, A., Ertoz, L., Kumar, V., Ozgur, A., & Srivastava, J. (2003) · Proceedings of the 2003 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972733.3 · Cited by 865
Self-citationLOCI: 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
Santini, S., & Jain, R. (1999) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.790428 · Cited by 761
Michalski, R. S., Mozetič, I., Hong, J., & Nada Lavrač, A. (1986) · National Conference on Artificial Intelligence · Cited by 747
Outlier Detection Using Replicator Neural Networks
Hawkins, S., He, H., Williams, G., & Baxter, R. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-46145-0_17 · Cited by 710
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
A Geometric Framework for Unsupervised Anomaly Detection: Detecting Intrusions in Unlabeled Data
Eskin, E., Arnold, A. O., Prerau, M. J., Portnoy, L., & Stolfo, S. J. (2002) · doi:10.7916/d8d50tqt · Cited by 603
BACON: blocked adaptive computationally efficient outlier nominators
Billor, N., Hadi, A. S., & Velleman, P. F. (2000) · Computational Statistics & Data Analysis · doi:10.1016/s0167-9473(99)00101-2 · Cited by 547
Finding generalized projected clusters in high dimensional spaces
Aggarwal, C. C., & Yu, P. S. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335383 · Cited by 530
Anomaly Detection over Noisy Data Using Learned Probability Distributions
Eskin, E. (2000) · doi:10.7916/d8c53skf · Cited by 469
Error-Correcting Output Coding Corrects Bias and Variance
Kong, E. B., & Dietterich, T. G. (1995) · Machine Learning Proceedings 1995 · doi:10.1016/b978-1-55860-377-6.50046-3 · Cited by 365
Finding generalized projected clusters in high dimensional spaces
Aggarwal, C. C., & Yu, P. S. (2000) · Proceedings of the 2000 ACM SIGMOD international conference on Management of data · doi:10.1145/342009.335383 · Cited by 295
FindOut : Finding Outliers in Very Large Datasets
Yu, D., Sheikholeslami, G., & Zhang, A. (2002) · Knowledge and Information Systems · doi:10.1007/s101150200013 · Cited by 196
SavvySearch: A Meta-Search Engine that Learns which Search Engines to Query
Howe, A. E., & Dreilinger, D. (1997) · Cited by 157
Joshi, M. V., Agarwal, R. C., & Kumar, V. (2001) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/375663.375673 · Cited by 130
Self-citationSun, P., & Chawla, S. (2005) · Proceedings · doi:10.1109/icdm.2004.10097 · Cited by 116
Re-designing distance functions and distance-based applications for high dimensional data
Aggarwal, C. C. (2001) · ACM SIGMOD Record · doi:10.1145/373626.373638 · Cited by 115
Joshi, M. V., Agarwal, R. C., & Kumar, V. (2002) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/775047.775092 · Cited by 101
Self-citationImproved Rooftop Detection in Aerial Images with Machine Learning
Maloof, M. A., Langley, P., Binford, T. O., Nevatia, R., & Sage, S. (2003) · Machine Learning · doi:10.1023/a:1025623527461 · Cited by 76
Proceedings - Fourth IEEE International Conference on Data Mining, ICDM 2004
Wang, J., & Karypis, G. (2004) · Cited by 29
(1996)
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
“. Performing anomaly detection in a reduced lower-dimensional space spanned by a small subset of original features or newly constructed features is a straightforward solution, e.g., in subspace-based [71, 78, 86, 124] and feature selection-based methods [12, 111, 113, 113]. However, identifying intricate (e.g., high-o…”
BackgroundIsolation-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
Graph based anomaly detection and description: a survey
Akoglu, L., Tong, H., & Koutra, D. (2015) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-014-0365-y · Cited by 1,504
“Several works (Gao and Tan 2006; Lazarevic and Kumar 2005) have proposed solutions to how to unite multiple outlierness scores.”
BackgroundGraph Neural Network-Based Anomaly Detection in Multivariate Time Series
Deng, A., & Hooi, B. (2021) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v35i5.16523 · Cited by 1,413
“• FB: A Feature Bagging detector is a meta-estimator that fits a number of detectors on various sub-samples of the dataset, then aggregates their scores (Lazarevic and Kumar 2005).”
BackgroundMethodInfluentialMAD-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
Metadata
- Authors
- Lazarevic, A., & Kumar, V.
- Venue
- Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
- Publisher
- ACM
- Published
- 2005-08-21
- Pages
- 157-166
- OpenAlex
- W2056081083
- Cited by
- 656
- References
- 39
- FWCI
- 7.63
- 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.