CoChat

One-Class versus Binary Classification: Which and When?

Bellinger, Colin, Sharma, Shiven, Japkowicz, Nathalie · 2012 · 2012 11th International Conference on Machine Learning and Applications
Cited by 86

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

Abstract

Binary classifiers have typically been the norm for building classification models in the Machine Learning community. However, an alternate to binary classification is one-class classification, which aims to build models using only a single class of data. This is particularly useful when there is an over-abundance of data of a particular class. In such imbalanced cases, binary classifiers may not perform very well, and one-class classifiers then become the viable option. In this paper, we are interested in investigating the performance of binary and one-class classifiers as the level of imbalance increases, and, thus, uncertainty in the second class. Our objective is to gain insight into which classification paradigm becomes more suitable as imbalance and uncertainty increase. To this end, we conduct experiments on various datasets, both artificial and from the UCI repository, and monitor the performance of the binary and one-class classifiers as the size of the second class gradually decreases, thus increasing the level of imbalance. The results show that as the level of imbalance increases, the performance of binary classifiers decreases, whereas one-class classifiers stay relatively stable.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/icmla.2012.212

Cites

2 of 2 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

  • Estimating the Support of a High-Dimensional Distribution

    Schölkopf, B., Platt, J. C., Shawe-Taylor, J., Smola, A. J., & Williamson, R. C. (2001) · Neural Computation · doi:10.1162/089976601750264965 · Cited by 6,168 · cited 2×

    “OCSVMs assume the origin in the kernel space to be the second class, and, subsequently, learn a boundary that separates the target class from the origin.”
    Background
  • A new algorithm for reducing the workload of experts in performing systematic reviews

    Matwin, S., Kouznetsov, A., Inkpen, D., Frunza, O., & O'Blenis, P. (2010) · Journal of the American Medical Informatics Association · doi:10.1136/jamia.2010.004325 · Cited by 100 · cited 1×

    “Examples of such domains include those in which there are almost an infinite number of instances from the outlier classes, such as in typist recognition [1], or those in which obtaining instances from the outlier classes is dependent upon the occurrence of a rare event1, such as the detection of oil spills [2] or the…”
    Background

Show all 2 references

Cited by

See all 86

Metadata

Authors
Bellinger, C., Sharma, S., & Japkowicz, N.
Venue
2012 11th International Conference on Machine Learning and Applications
Publisher
IEEE
Published
2012-12
Pages
102-106
OpenAlex
W1967158716
Cited by
86
References
2
FWCI
2.22
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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: One-Class versus Binary Classification: Which and When? https://app.cochat.ai/papers/10.1109/icmla.2012.212
The paper
Bellinger, C., Sharma, S., & Japkowicz, N. (2012). One-Class versus Binary Classification: Which and When? 2012 11th International Conference on Machine Learning and Applications. https://doi.org/10.1109/icmla.2012.212

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.