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

DOI10.1007/S10994-016-5572-XzbMATH Open1386.68136OpenAlexW2479224401WikidataQ58642631 ScholiaQ58642631MaRDI QIDQ331693FDOQ331693

Authors: Nikolaos Nikolaou, Narayanan Edakunni, Meelis Kull, Gavin Brown, Peter 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

Recommendations

• Cost-sensitive boosting for classification of imbalanced data
• Boosted classification trees and class probability/quantile estimation
• scientific article; zbMATH DE number 1717316
• Cost-sensitive learning and decision making revisited
• Cost-sensitive ensemble learning: a unifying framework

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)

Cites Work

• A decision-theoretic generalization of on-line learning and an application to boosting
• Statistical comparisons of classifiers over multiple data sets
• 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)
• Title not available (Why is that?)
• Boosting as a regularized path to a maximum margin classifier
• Improved boosting algorithms using confidence-rated predictions
• Training Products of Experts by Minimizing Contrastive Divergence
• Machine learning. The art and science of algorithms that make sense of data.
• Explaining AdaBoost
• Paradoxes of fuzzy logic, revisited
• Cost-sensitive boosting for classification of imbalanced data

Cited In (8)

• Cost-sensitive ensemble learning: a unifying framework
• Predicting mortgage early delinquency with machine learning methods
• Cost-sensitive thresholding over a two-dimensional decision region for fraud detection
• Boosted classification trees and class probability/quantile estimation
• Cost-sensitive boosting for classification of imbalanced data
• Beyond sigmoids: how to obtain well-calibrated probabilities from binary classifiers with beta calibration
• Cost-sensitive learning and decision making revisited
• Adaptive stochastic gradient boosting tree with composite criterion

Uses Software

• AdaBoost.MH
• AdaCost

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q331693)