Untangling AdaBoost-based Cost-Sensitive Classification. Part II: Empirical Analysis
A lot of approaches, each following a different strategy, have been proposed in the literature to provide AdaBoost with cost-sensitive properties. In the first part of this series of two papers, we have presented these algorithms in a homogeneous notational framework, proposed a clustering scheme for them and performed a thorough theoretical analysis of those approaches with a fully theoretical foundation. The present paper, in order to complete our analysis, is focused on the empirical study of all the algorithms previously presented over a wide range of heterogeneous classification problems. The results of our experiments, confirming the theoretical conclusions, seem to reveal that the simplest approach, just based on cost-sensitive weight initialization, is the one showing the best and soundest results, despite having been recurrently overlooked in the literature.
Code (0)
등록된 구현이 없습니다.
Tasks
ClassificationClusteringGeneral ClassificationSimilar Papers 제목 키워드 기반
Untangling AdaBoost-based Cost-Sensitive Classification. Part I: Theoretical Perspective
Boosting algorithms have been widely used to tackle a plethora of problems. In the last few years, a lot of approaches have been proposed to provide standard AdaBoost with cost-sensitive capabilities, each with a differe…
ClassificationGeneral ClassificationBAdaCost: Multi-class Boosting with Costs
We present BAdaCost, a multi-class cost-sensitive classification algorithm. It combines a set of cost-sensitive multi-class weak learners to obtain a strong classification rule within the Boosting framework. To derive th…
ClassificationMulti-class ClassificationDouble-Base Asymmetric AdaBoost
Based on the use of different exponential bases to define class-dependent error bounds, a new and highly efficient asymmetric boosting scheme, coined as AdaBoostDB (Double-Base), is proposed. Supported by a fully theoret…
Misclassification cost-sensitive ensemble learning: A unifying framework
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 …
Ensemble LearningAdaBoost-assisted Extreme Learning Machine for Efficient Online Sequential Classification
In this paper, we propose an AdaBoost-assisted extreme learning machine for efficient online sequential classification (AOS-ELM). In order to achieve better accuracy in online sequential learning scenarios, we utilize th…
General Classification