Evidence map›Paper›PMID 29423442›Full record

ArticleScience advances2018

Neyman-Pearson classification algorithms and NP receiver operating characteristics.

Xin Tong, Yang Feng, Jingyi Jessica Li

Open access · goldAbstract read
In one paragraph

Article in Science advances, 2018. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 15 papers, 1 of them a synthesis that pooled it.

0numbers the graph read from it
0cells of the map it votes in
15citing papers in PubMed, 1 pooled it
8.0field-weighted citation impact, top 2% of its field
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

15 citing papers in PubMed, 1 synthesis or guideline pooled it, 83 citations in OpenAlex.

  1. Pooled it
  2. Article
  3. Article
  4. Neyman-Pearson Multi-class Classification via Cost-sensitive Learning.Journal of the American Statistical Association · 2025
    Article
  5. Federated Learning with Convex Global and Local Constraints.Transactions on machine learning research · 2024
    Article
  6. Article
  7. Article
  8. Article
  9. Article
  10. A flexible model-free prediction-based framework for feature ranking.Journal of machine learning research : JMLR · 2021
    Article
  11. Article
  12. Article
  13. Review
  14. Article
  15. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

3 authors at 3 institutions in 1 country.

Xin TongDepartment of Data Sciences and Operations, Marshall School of Business, University of Southern California, Los Angeles, CA 90089, USA.ORCID 0000-0001-8534-3827
Yang FengDepartment of Statistics, Columbia University, New York, NY 10027-5927, USA.ORCID 0000-0001-7746-7598
Jingyi Jessica LiDepartment of Statistics, University of California, Los Angeles, CA 90095-1554, USA.ORCID 0000-0002-9288-5648
Columbia University · USUniversity of California, Los Angeles · USUniversity of Southern California · US

Funding

Robust Identification and accurate quantification of RNA transcripts on a system wide scaleR01GM120507 · NIGMS · UNIVERSITY OF CALIFORNIA LOS ANGELES · PI LI, JINGYI JESSICA · 2016 to 2021
$1.7M
6 · The paper itself

Abstract

In many binary classification applications, such as disease diagnosis and spam detection, practitioners commonly face the need to limit type I error (that is, the conditional probability of misclassifying a class 0 observation as class 1) so that it remains below a desired threshold. To address this need, the Neyman-Pearson (NP) classification paradigm is a natural choice; it minimizes type II error (that is, the conditional probability of misclassifying a class 1 observation as class 0) while enforcing an upper bound, α, on the type I error. Despite its century-long history in hypothesis testing, the NP paradigm has not been well recognized and implemented in classification schemes. Common practices that directly limit the empirical type I error to no more than α do not satisfy the type I error control objective because the resulting classifiers are likely to have type I errors much larger than α, and the NP paradigm has not been properly implemented in practice. We develop the first umbrella algorithm that implements the NP paradigm for all scoring-type classification methods, such as logistic regression, support vector machines, and random forests. Powered by this algorithm, we propose a novel graphical tool for NP classification methods: NP receiver operating characteristic (NP-ROC) bands motivated by the popular ROC curves. NP-ROC bands will help choose α in a data-adaptive way and compare different NP classifiers. We demonstrate the use and properties of the NP umbrella algorithm and NP-ROC bands, available in the R package nproc, through simulation and real data studies.

Indexed as

AlgorithmsROC CurveProbability

Identifiers

PMID29423442
PMCPMC5804623
OpenAlexW2788398385

What OpenQuestion holds

Textmetadata
LicenceCC BY-NC
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.