Theory and algorithms for learning with rejection in binary classification
From MaRDI portal
Recommendations
Cites work
- Classification with a reject option using a hinge loss
- Convex calibration dimension for multiclass loss matrices
- Empirical margin distributions and bounding the generalization error of combined classifiers
- Foundations of machine learning
- Generalization bounds for averaged classifiers
- On optimum recognition error and reject tradeoff
- On the foundations of noise-free selective classification
- Probability in Banach spaces. Isoperimetry and processes
- Support vector machines with embedded reject option
This page was built for publication: Theory and algorithms for learning with rejection in binary classification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6496421)