An extensive empirical comparison of ensemble learning methods for binary classification

作者：Narassiguin Anil; Bibimoune Mohamed; Elghazel Haytham^*; Aussem Alex

来源：Pattern Analysis and Applications, 2016, 19(4): 1093-1128.

DOI：10.1007/s10044-016-0553-z

• Ensemble learning
• Empirical analysis
• Binary classification

We present an extensive empirical comparison between nineteen prototypical supervised ensemble learning algorithms, including Boosting, Bagging, Random Forests, Rotation Forests, Arc-X4, Class-Switching and their variants, as well as more recent techniques like Random Patches. These algorithms were compared against each other in terms of threshold, ranking/ordering and probability metrics over nineteen UCI benchmark data sets with binary labels. We also examine the influence of two base learners, CART and Extremely Randomized Trees, on the bias-variance decomposition and the effect of calibrating the models via Isotonic Regression on each performance metric. The selected data sets were already used in various empirical studies and cover different application domains. The source code and the detailed results of our study are publicly available.

• 出版日期2016-11