A decision-theoretic generalization of on-line learning and an application to boosting
Journal of Computer and System Sciences - Special issue: 26th annual ACM symposium on the theory of computing & STOC'94, May 23–25, 1994, and second annual Europe an conference on computational learning theory (EuroCOLT'95), March 13–15, 1995
MetaCost: a general method for making classifiers cost-sensitive
KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
AdaCost: Misclassification Cost-Sensitive Boosting
ICML '99 Proceedings of the Sixteenth International Conference on Machine Learning
A Comparative Study of Cost-Sensitive Boosting Algorithms
ICML '00 Proceedings of the Seventeenth International Conference on Machine Learning
Pattern Classification (2nd Edition)
Pattern Classification (2nd Edition)
Learning from imbalanced data sets with boosting and data generation: the DataBoost-IM approach
ACM SIGKDD Explorations Newsletter - Special issue on learning from imbalanced datasets
Cost-sensitive learning and decision making for massachusetts pip claim fraud data
International Journal of Intelligent Systems
Parameter inference of cost-sensitive boosting algorithms
MLDM'05 Proceedings of the 4th international conference on Machine Learning and Data Mining in Pattern Recognition
Asymmetric Learning for Pedestrian Detection Based on Joint Local Orientation Histograms
ISNN '09 Proceedings of the 6th International Symposium on Neural Networks on Advances in Neural Networks
Exploratory undersampling for class-imbalance learning
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Cost-Sensitive Boosting: Fitting an Additive Asymmetric Logistic Regression Model
ACML '09 Proceedings of the 1st Asian Conference on Machine Learning: Advances in Machine Learning
CSNL: A cost-sensitive non-linear decision tree algorithm
ACM Transactions on Knowledge Discovery from Data (TKDD)
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Class-specific error bounds for ensemble classifiers
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
RAMOBoost: ranked minority oversampling in boosting
IEEE Transactions on Neural Networks
Predicting handoffs in 3G networks
MobiHeld '11 Proceedings of the 3rd ACM SOSP Workshop on Networking, Systems, and Applications on Mobile Handhelds
QBoost: Predicting quantiles with boosting for regression and binary classification
Expert Systems with Applications: An International Journal
Predicting handoffs in 3G networks
ACM SIGOPS Operating Systems Review
Shedding light on the asymmetric learning capability of AdaBoost
Pattern Recognition Letters
Decision tree classifiers sensitive to heterogeneous costs
Journal of Systems and Software
Towards cost-sensitive learning for real-world applications
PAKDD'11 Proceedings of the 15th international conference on New Frontiers in Applied Data Mining
A new framework for optimal classifier design
Pattern Recognition
Double-base asymmetric AdaBoost
Neurocomputing
Hi-index | 0.00 |
A cost-sensitive extension of boosting, denoted as asymmetric boosting, is presented. Unlike previous proposals, the new algorithm is derived from sound decision-theoretic principles, which exploit the statistical interpretation of boosting to determine a principled extension of the boosting loss. Similarly to AdaBoost, the cost-sensitive extension minimizes this loss by gradient descent on the functional space of convex combinations of weak learners, and produces large margin detectors. It is shown that asymmetric boosting is fully compatible with AdaBoost, in the sense that it becomes the latter when errors are weighted equally. Experimental evidence is provided to demonstrate the claims of cost-sensitivity and large margin. The algorithm is also applied to the computer vision problem of face detection, where it is shown to outperform a number of previous heuristic proposals for cost-sensitive boosting (AdaCost, CSB0, CSB1, CSB2, asymmetric-AdaBoost, AdaC1, AdaC2 and AdaC3).