Cost-sensitive ensemble learning: a unifying framework

DOI10.1007/S10618-021-00790-4MaRDI QIDQ832635zbMATH OpenOpenAlexFDO

Authors George Petrides, Wouter Verbeke

Publication date 25 March 2022

Published in Data Mining and Knowledge Discovery (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2007.07361

zbMATH Keywords

classificationclass imbalancecost-sensitive learningmisclassification cost

Mathematics Subject Classification ID

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

Abstract: Over the years, a plethora of cost-sensitive methods have been proposed for learning on data when different types of misclassification errors incur different costs. Our contribution is a unifying framework that provides a comprehensive and insightful overview on cost-sensitive ensemble methods, pinpointing their differences and similarities via a fine-grained categorization. Our framework contains natural extensions and generalisations of ideas across methods, be it AdaBoost, Bagging or Random Forest, and as a result not only yields all methods known to date but also some not previously considered.

Recommendations

• A cost-sensitive ensemble method for class-imbalanced datasets
• Toward Efficient Ensemble Learning with Structure Constraints: Convergent Algorithms and Applications
• Ensemble learning based on approximate reducts and bootstrap sampling
• Cost complexity-based pruning of ensemble classifiers

Cites work

• scientific article; zbMATH DE number 3860199 (Why is no real title available?)
• scientific article; zbMATH DE number 193111 (Why is no real title available?)
• scientific article; zbMATH DE number 1753143 (Why is no real title available?)
• A decision-theoretic generalization of on-line learning and an application to boosting
• A survey of cost-sensitive decision tree induction algorithms
• Additive logistic regression: a statistical view of boosting. (With discussion and a rejoinder by the authors)
• An Empirical Distribution Function for Sampling with Incomplete Information
• Bagging predictors
• Benchmarking state-of-the-art classification algorithms for credit scoring: an update of research
• Cost-sensitive boosting algorithms: do we really need them?
• Cost-sensitive boosting for classification of imbalanced data
• Greedy function approximation: A gradient boosting machine.
• Improved boosting algorithms using confidence-rated predictions
• Random forests
• Robust classification for imprecise environments

Cited in

(5)

• Cost-sensitive boosting algorithms: do we really need them?
• Robust instance-dependent cost-sensitive classification
• Cost-sensitive learning and decision making revisited
• Angle-based cost-sensitive multicategory classification
• Toward Efficient Ensemble Learning with Structure Constraints: Convergent Algorithms and Applications

Describes a project that uses

Uses Software

• SMOTE
• AdaCost
• XGBoost
• SMOTEBoost
• C4.5
• AdaBoost.MH
• R

This page was built for publication: Cost-sensitive ensemble learning: a unifying framework

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