Regularization in skewed binary classification
The paper deals with the problem of overfitting in classification of a new unknown object to one of two populations, 0 and 1, on the basis of a q-dimensional explanatory vector \(x=(x_1,\dots,x_q)\), where one of the populations, for example population 0, is the prelevent class and population 1 is a rare class. The author proposed a solution to this problem by increasing the occurrence of the rare cases by producing noisy replicates in the training data from the rare cases while keeping the objects from the dominant class without changes. He studies the effect of adding noise during training for several classification approaches: nearest neighbor method, neural networks, classification trees and quadratic discriminants. Computer experiments on three data sets from the Information and Computer Science repository of the University of California at Urvine were carried out. Promising and encouraging results are obtained.
- Bagging predictors
- scientific article; zbMATH DE number 3860199 (Why is no real title available?)
- scientific article; zbMATH DE number 692302 (Why is no real title available?)
- scientific article; zbMATH DE number 835699 (Why is no real title available?)
- Regularization in discriminant analysis: an overview
- Noisy replication in skewed binary classification.
- Neural learning from unbalanced data
- Training and assessing classification rules with imbalanced data
- scientific article; zbMATH DE number 1708093 (Why is no real title available?)
- Classification From Positive and Biased Negative Data With Skewed Labeled Posterior Probability
This page was built for publication: Regularization in skewed binary classification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1966373)
