Cited by 1,250Imbalanced Data Classification TechniquesMachine Learning and Data ClassificationData Mining and Machine Learning Applications

Robust classification for imprecise environments

Open access
Provost, Foster, Fawcett, Tom·2001·Machine Learning

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Integrity signals

Registry

Crossref · 10.1023/a:1007601015854

Cites

44 of 44 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 4

  1. Catlett, J. (1995). Tailoring rulesets to misclassification costs. In Proceedings of the Fifth International Workshop on Artificial Intelligence and Statistics (pp. 88-94).
  2. Cherikh, M. (1989). Optimal Decision and Detection in the Decentralized Case. Ph.D. Thesis, Case Western Reserve University.
  3. In R. Ramakrishnan & S. Stolfo (Eds.), Proceedings on the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.
  4. Srinivasan, A. (1999). Note on the location of optimal classifiers in ROC space. Technical report PRG-TR-2-99, Oxford University.

Cited by

Sorted by citations

Authors
Provost, F., & Fawcett, T.
Affiliations
  • New York University (US)
  • Hewlett-Packard (United States) (US)
Venue
Machine Learning
Published
2001-03
Volume
42
Issue
3
Pages
203-231
ISSN
  • 0885-6125 (ISSN-L)
  • 1573-0565
OpenAlex
W2096942889
Cited by
1,250
References
44
Citations by year
2026: 35 · 2025: 29 · 2024: 23 · 2023: 27 · 2022: 42 · 2021: 41 · 2020: 57 · 2019: 40 · 2018: 42 · 2017: 37 · 2016: 44 · 2015: 40 · 2014: 61 · 2013: 55 · 2012: 50
FWCI
51.02
Type
journal article
Language
en
Open access
Locations
  • Machine Learning (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • Faculty Digital Archive (New York University Florence) (submittedVersion)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Imbalanced Data Classification Techniques
  • Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Data Classification
  • Physical Sciences › Computer Science › Information Systems › Data Mining and Machine Learning Applications
Keywords
robust classification, hybrid classifier, misclassification cost, classifier comparison, decision analysis, computational geometry, sensitivity analysis, expected cost

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