Asymmetric boosting
Open Access
- 20 June 2007
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 609-619
Abstract
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 de- tectors. 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 pre- vious heuristic proposals for cost-sensitive boost- ing (AdaCost, CSB0, CSB1, CSB2, asymmetric- AdaBoost, AdaC1, AdaC2 and AdaC3).Keywords
This publication has 8 references indexed in Scilit:
- Parameter Inference of Cost-Sensitive Boosting AlgorithmsLecture Notes in Computer Science, 2005
- Learning from imbalanced data sets with boosting and data generationACM SIGKDD Explorations Newsletter, 2004
- Mining the Risk Types of Human Papillomavirus (HPV) by AdaCostLecture Notes in Computer Science, 2003
- SMOTEBoost: Improving Prediction of the Minority Class in Boosting2003
- The Elements of Statistical Learning2001
- Additive logistic regression: a statistical view of boosting (With discussion and a rejoinder by the authors)The Annals of Statistics, 2000
- MetaCost1999
- A Decision-Theoretic Generalization of On-Line Learning and an Application to BoostingJournal of Computer and System Sciences, 1997