The Heterogeneous Ensembles of Standard Classification Algorithms (HESCA): the Whole is Greater than the Sum of its Parts

Abstract

Building classification models is an intrinsically practical exercise that requires many design decisions prior to deployment. We aim to provide some guidance in this decision making process. Specifically, given a classification problem with real valued attributes, we consider which classifier or family of classifiers should one use. Strong contenders are tree based homogeneous ensembles, support vector machines or deep neural networks. All three families of model could claim to be state-of-the-art, and yet it is not clear when one is preferable to the others. Our extensive experiments with over 200 data sets from two distinct archives demonstrate that, rather than choose a single family and expend computing resources on optimising that model, it is significantly better to build simpler versions of classifiers from each family and ensemble. We show that the Heterogeneous Ensembles of Standard Classification Algorithms (HESCA), which ensembles based on error estimates formed on the train data, is significantly better (in terms of error, balanced error, negative log likelihood and area under the ROC curve) than its individual components, picking the component that is best on train data, and a support vector machine tuned over 1089 different parameter configurations. We demonstrate HESCA+, which contains a deep neural network, a support vector machine and two decision tree forests, is significantly better than its components, picking the best component, and HESCA. We analyse the results further and find that HESCA and HESCA+ are of particular value when the train set size is relatively small and the problem has multiple classes. HESCA is a fast approach that is, on average, as good as state-of-the-art classifiers, whereas HESCA+ is significantly better than average and represents a strong benchmark for future research.

References in corpus (6)

• XGBoost: A Scalable Tree Boosting System
• Popular Ensemble Methods: An Empirical Study
• Issues in Stacked Generalization
• Should we really use post-hoc tests based on mean-ranks?
• A General Distributed Dual Coordinate Optimization Framework for Regularized Loss Minimization
• On the Use of Default Parameter Settings in the Empirical Evaluation of Classification Algorithms

Cited by in corpus (10)

• Benchmarking Multivariate Time Series Classification Algorithms
• HIVE-COTE 2.0: a new meta ensemble for time series classification
• Bake off redux: a review and experimental evaluation of recent time series classification algorithms
• A Transfer Learning and Optimized CNN Based Intrusion Detection System for Internet of Vehicles
• Scalable Dictionary Classifiers for Time Series Classification
• A tale of two toolkits, report the third: on the usage and performance of HIVE-COTE v1.0
• Visualizing Ensemble Predictions of Music Mood
• RTFN: A Robust Temporal Feature Network for Time Series Classification
• RED CoMETS: An ensemble classifier for symbolically represented multivariate time series
• Enhancing Morpho-Kinematic analysis for Plant Water Stress Classification through Leaf Movements