The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Outlier detection by active learning
Abstract
Most existing approaches to outlier detection are based on density estimation methods. There are two notable issues with these methods: one is the lack of explanation for outlier flagging decisions, and the other is the relatively high computational requirement. In this paper, we present a novel approach to outlier detection based on classification, in an attempt to address both of these issues. Our approach isbased on two key ideas. First, we present a simple reduction of outlier detection to classification, via a procedure that involves applying classification to a labeled data set containing artificially generated examples that play the role of potential outliers. Once the task has been reduced to classification, we then invoke a selective sampling mechanism based on active learning to the reduced classification problem. We empirically evaluate the proposed approach using a number of data sets, and find that our method is superior to other methods based on the same reduction to classification, but using standard classification methods. We also show that it is competitive to the state-of-the-art outlier detection methods in the literature based on density estimation, while significantly improving the computational complexity and explanatory power.
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
A decision-theoretic generalization of on-line learning and an application to boosting
Freund, Y., & Schapire, R. E. (1997) · Journal of Computer and System Sciences · doi:10.1006/jcss.1997.1504 · Cited by 20,466
Breiman, L. (1996) · Machine Learning · doi:10.1007/bf00058655 · Cited by 16,325 · cited 1×
“Ensemble-based minimum margin active learning combines the ideas of query by committee [14] and ensemble methodology for classification accuracy enhancement [8, 4].”
BackgroundLOF: 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 3×
“Most of the existing approaches to the problem of outlier detection in the literature have been based on density estimation methods, and in particular, on nearest-neighbor methods [3, 6 , 10, 11, 14].”
MethodInfluentialEfficient 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
Seung, H. S., Opper, M., & Sompolinsky, H. (1992) · Proceedings of the fifth annual workshop on Computational learning theory · doi:10.1145/130385.130417 · Cited by 1,651
Algorithms for Mining Distance-Based Outliers in Large Datasets
Knorr, E. M., & Ng, R. T. (1998) · Cited by 1,544
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 1×
“Most of the existing approaches to the problem of outlier detection in the literature have been based on density estimation methods, and in particular, on nearest-neighbor methods [5, 9, 10, 13].”
BackgroundOutlier 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
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
Query Learning Strategies Using Boosting and Bagging
Abe, N., & Mamitsuka, H. (1998) · International Conference on Machine Learning · Cited by 348
Self-citationProceedings of the 17th International Conference on Pattern Recognition ICPR 2004
(2004) · Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004. · doi:10.1109/icpr.2004.1334435 · Cited by 342
Diverse ensembles for active learning
Melville, P., & Mooney, R. J. (2004) · Twenty-first international conference on Machine learning - ICML '04 · doi:10.1145/1015330.1015385 · Cited by 319
A Classification Framework for Anomaly Detection
Steinwart, I., Hush, D. R., & Scovel, C. (2005) · Journal of Machine Learning Research · doi:10.5555/1046920.1058109 · Cited by 279
Parzen-window network intrusion detectors
Yeung, D.-Y., & Chow, C. (2003) · Object recognition supported by user interaction for service robots · doi:10.1109/icpr.2002.1047476 · Cited by 277
Using artificial anomalies to detect unknown and known network intrusions
Fan, W., Miller, M., Stolfo, S., Lee, W., & Chan, P. (2004) · Knowledge and Information Systems · doi:10.1007/s10115-003-0132-7 · Cited by 222
Resampling approach for anomaly detection in multispectral images
Theiler, J. P., & Cai, D. M. (2003) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.487069 · Cited by 80
Learning Distributions by Their Density Levels: A Paradigm for Learning without a Teacher
Ben-David, S., & Lindenbaum, M. (1997) · Journal of Computer and System Sciences · doi:10.1006/jcss.1997.1507 · Cited by 56
Cited by
Chandola, V., Banerjee, A., & Kumar, V. (2009) · ACM Computing Surveys · doi:10.1145/1541880.1541882 · Cited by 11,687
“A number of techniques have been proposed that inject artificial anomalies in a normal data set to obtain a labeled training data set [Theiler and Cai 2003; Abe et al. 2006; Steinwart et al. 2005].”
BackgroundLiu, 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
“Apart from the key difference of isolation versus pro-filing, iForest is distinguished from existing model-based [11, 1, 5], distance-based [6] and density-based methods [4] in the follow ways: • The isolation characteristic of iTrees enables them to build partial models and exploit sub-sampling to…”
BackgroundMethodIsolation-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
“…[Saltenis, 2004], clustering-based [He et al., 2003, Lieto et al., 2008, Miller and Browning, 2003, Wang et al., 2012c], classification-based [Abe et al., 2006, Hempstalk et al., 2008, Janssens et al., 2009], information theory-based [Ando, 2007, Böhm et al., 2009, Smets and Vreeken, 2011],…”
A Comparative Evaluation of Unsupervised Anomaly Detection Algorithms for Multivariate Data
Goldstein, M., & Uchida, S. (2016) · PLOS ONE · doi:10.1371/journal.pone.0152173 · Cited by 1,032
Metadata
- Authors
- Abe, N., Zadrozny, B., & Langford, J.
- Venue
- Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
- Publisher
- ACM
- Published
- 2006-08-20
- Pages
- 504-509
- OpenAlex
- W1991357106
- Cited by
- 322
- References
- 18
- FWCI
- 4.80
- 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.