Robust Boosting Algorithm Against Mislabeling in Multiclass Problems
From MaRDI portal
Recommendations
Cites work
- 10.1162/15324430260185628
- A class of logistic-type discriminant functions
- A decision-theoretic generalization of on-line learning and an application to boosting
- Additive logistic regression: a statistical view of boosting. (With discussion and a rejoinder by the authors)
- Convexity, Classification, and Risk Bounds
- Improved boosting algorithms using confidence-rated predictions
- Information Geometry of U-Boost and Bregman Divergence
- Robustifying AdaBoost by Adding the Naive Error Rate
- Soft margins for AdaBoost
Cited in
(11)- A ROBUST BOOSTING METHOD FOR MISLABELED DATA
- Geometry of EM and related iterative algorithms
- A simple extension of boosting for asymmetric mislabeled data
- Binary classification with a pseudo exponential model and its application for multi-task learning
- Entropy and divergence associated with power function and the statistical application
- A boosting method with asymmetric mislabeling probabilities which depend on covariates
- Learning kernel logistic regression in the presence of class label noise
- An extension of the receiver operating characteristic curve and AUC-optimal classification
- Deformation of log-likelihood loss function for multiclass boosting
- An estimation of generalized Bradley-Terry models based on the EM algorithm
- A correction on TangentBoost algorithm
This page was built for publication: Robust Boosting Algorithm Against Mislabeling in Multiclass Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3503733)