npcs: Neyman-Pearson Classification via Cost-Sensitive Learning

We connect the multi-class Neyman-Pearson classification (NP) problem to the cost-sensitive learning (CS) problem, and propose two algorithms (NPMC-CX and NPMC-ER) to solve the multi-class NP problem through cost-sensitive learning tools. Under certain conditions, the two algorithms are shown to satisfy multi-class NP properties. More details are available in the paper "Neyman-Pearson Multi-class Classification via Cost-sensitive Learning" (Ye Tian and Yang Feng, 2021), which will be posted on arXiv soon.

Version: 0.1.0
Depends: R (≥ 3.5.0)
Imports: dfoptim, nnet, randomForest, e1071, magrittr, MASS, smotefamily, rpart, foreach, naivebayes, caret, formatR
Suggests: knitr, rmarkdown
Published: 2021-10-19
Author: Ye Tian [aut, cre], Yang Feng [aut]
Maintainer: Ye Tian <ye.t at>
License: GPL-2
NeedsCompilation: no
CRAN checks: npcs results


Reference manual: npcs.pdf
Vignettes: npcs-demo


Package source: npcs_0.1.0.tar.gz
Windows binaries: r-devel:, r-release: not available, r-oldrel: not available
macOS binaries: r-release (arm64): npcs_0.1.0.tgz, r-release (x86_64): npcs_0.1.0.tgz, r-oldrel: npcs_0.1.0.tgz


Please use the canonical form to link to this page.