Combining One-Class Classifiers
The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
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
(1973) · CERN Document Server (European Organization for Nuclear Research) · Cited by 12,895
The use of the area under the ROC curve in the evaluation of machine learning algorithms
Bradley, A. P. (1997) · Pattern Recognition · doi:10.1016/s0031-3203(96)00142-2 · Cited by 7,217 · cited 3×
“This is called the Area Under the Curve (AUC) [2], and it measures the total error integrated over (in principle) all threshold values.”
BackgroundInfluentialKittler, J., Hatef, M., Duin, R. P. W., & Matas, J. (1998) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.667881 · Cited by 5,290 · cited 1×
“In [7] and in [8] a theoretical framework for combining (estimated posterior probabilities from) normal classifiers is developed.”
BackgroundSelf-citationPattern classification and scene analysis
Chien, Y. (1974) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1974.1100577 · Cited by 3,398
Support vector domain description
Tax, D. M. J., & Duin, R. P. W. (1999) · Pattern Recognition Letters · doi:10.1016/s0167-8655(99)00087-2 · Cited by 1,614 · cited 1×
“Here we will use four simple models, the support vector data description [14], k-means clustering, k-center method [15] and an autoencoder neural network [6].”
MethodSelf-citationART 2-A: An adaptive resonance algorithm for rapid category learning and recognition
Carpenter, G. A., Grossberg, S., & Rosen, D. B. (1991) · Neural Networks · doi:10.1016/0893-6080(91)90045-7 · Cited by 466
Consensus theoretic classification methods
Benediktsson, J. A., & Swain, P. H. (1992) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/21.156582 · Cited by 357 · cited 1×
“When the Bayes theorem is adopted for the combination of different classifiers, a product combination rule automatically appears under the assumption of independence: the outputs of the individual classifiers are multiplied and then normalized (this is also called a logarithmic opinion pool [1]).”
Novelty detection for the identification of masses in mammograms
Tarassenko, L. (1995) · 4th International Conference on Artificial Neural Networks · doi:10.1049/cp:19950597 · Cited by 350 · cited 1×
“In most cases the probability density of the target set is modeled [12].”
BackgroundData domain description using support vectors.
Tax, D. M. J., & Duin, R. P. W. (1999) · Cited by 282
Self-citationOne-class classifier networks for target recognition applications
Moya, M. M., Koch, M. W., & Hostetler, L. D. (1993) · NASA STI/Recon Technical Report N · Cited by 236
Cited by
A survey of multiple classifier systems as hybrid systems
Woźniak, M., Graña, M., & Corchado, E. (2014) · Information Fusion · doi:10.1016/j.inffus.2013.04.006 · Cited by 912
One-class classification: taxonomy of study and review of techniques
Khan, S. S., & Madden, M. G. (2014) · The Knowledge Engineering Review · doi:10.1017/s026988891300043x · Cited by 600
McPAD: A multiple classifier system for accurate payload-based anomaly detection
Perdisci, R., Ariu, D., Fogla, P., Giacinto, G., & Lee, W. (2009) · Computer Networks · doi:10.1016/j.comnet.2008.11.011 · Cited by 269
Using an Ensemble of One-Class SVM Classifiers to Harden Payload-based Anomaly Detection Systems
Perdisci, R., Gu, G., & Lee, W. (2006) · Sixth International Conference on Data Mining (ICDM'06) · doi:10.1109/icdm.2006.165 · Cited by 239
“A rejection rate is usually chosen during training so that a certain percentage of training patterns lies outside the constructed decision surface in order to take into account the possible presence of noise (i.e., unlabeled outliers) in the training set and to obtain a more precise description of the target class [ 2…”
BackgroundInfluentialIntrusion detection in computer networks by a modular ensemble of one-class classifiers
Giacinto, G., Perdisci, R., Del Rio, M., & Roli, F. (2008) · Information Fusion · doi:10.1016/j.inffus.2006.10.002 · Cited by 218
“[25] proposed to consider the distribution of the outlier to be constant in a suitable region of the feature set, so that the a posteriori probability for the target class, for example, can be approximated as”
BackgroundMethodInfluentialRandom forest as one-class classifier and infrared spectroscopy for food adulteration detection
de Santana, F. B., Borges Neto, W., & Poppi, R. J. (2019) · Food Chemistry · doi:10.1016/j.foodchem.2019.04.073 · Cited by 203
Stein, B., Lipka, N., & Prettenhofer, P. (2011) · Language Resources and Evaluation · doi:10.1007/s10579-010-9115-y · Cited by 194
Metadata
- Authors
- Tax, D. M. J., & Duin, R. P. W.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2001
- Pages
- 299-308
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1527858862
- Cited by
- 175
- References
- 11
- FWCI
- 1.79
- 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.