Cost-sensitive boosting algorithms: do we really need them?

DOI10.1007/s10994-016-5572-xzbMath1386.68136OpenAlexW2479224401WikidataQ58642631 ScholiaQ58642631MaRDI QIDQ331693

Narayanan Edakunni, Nikolaos Nikolaou, Gavin Brown, Meelis Kull, Peter A. Flach

Publication date: 27 October 2016

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-016-5572-x

zbMATH Keywords

boostingclassifier calibrationclass imbalancecost-sensitive

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (3)

Cost-sensitive ensemble learning: a unifying framework ⋮ Cost-sensitive thresholding over a two-dimensional decision region for fraud detection ⋮ Predicting mortgage early delinquency with machine learning methods

Uses Software

• AdaBoost.MH
• AdaCost

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cost-sensitive boosting for classification of imbalanced data
• A decision-theoretic generalization of on-line learning and an application to boosting
• Boosting the margin: a new explanation for the effectiveness of voting methods
• Additive logistic regression: a statistical view of boosting. (With discussion and a rejoinder by the authors)
• Improved boosting algorithms using confidence-rated predictions
• Machine Learning
• Training Products of Experts by Minimizing Contrastive Divergence
• Explaining AdaBoost
• Paradoxes of fuzzy logic, revisited

This page was built for publication: Cost-sensitive boosting algorithms: do we really need them?