Cost-sensitive boosting algorithms: Do we really need them?
Open Access
- 2 August 2016
- journal article
- research article
- Published by Springer Nature in Machine Learning
- Vol. 104 (2-3) , 359-384
Abstract
No abstract availableKeywords
Funding Information
- Engineering and Physical Sciences Research Council (EP/L000725/1, EP/I028099/1)
- Engineering and Physical Sciences Research Council (EP/K018728/1, EP/K018728/1)
This publication has 19 references indexed in Scilit:
- Double-base asymmetric AdaBoostNeurocomputing, 2013
- Machine Learning2012
- Shedding light on the asymmetric learning capability of AdaBoostPattern Recognition Letters, 2012
- Asymmetric boosting2007
- An empirical comparison of supervised learning algorithms2006
- Training Products of Experts by Minimizing Contrastive DivergenceNeural Computation, 2002
- Explicitly representing expected cost2000
- Additive logistic regression: a statistical view of boosting (With discussion and a rejoinder by the authors)The Annals of Statistics, 2000
- A Decision-Theoretic Generalization of On-Line Learning and an Application to BoostingJournal of Computer and System Sciences, 1997
- VERIFICATION OF FORECASTS EXPRESSED IN TERMS OF PROBABILITYMonthly Weather Review, 1950