Feature-subspace aggregating: ensembles for stable and unstable learners

• Published in: Machine learning 2011-03, Vol.82 (3), p.375-397
• Main Authors: Ting, Kai Ming, Wells, Jonathan R., Tan, Swee Chuan, Teng, Shyh Wei, Webb, Geoffrey I.
• Format: Article
• Language: English
• Subjects: Applied sciences; Artificial Intelligence; Computer Science; Computer science; control theory; systems; Control; Data processing. List processing. Character string processing; Exact sciences and technology; Mechatronics; Memory organisation. Data processing; Natural Language Processing (NLP); Robotics; Simulation and Modeling; Software
• ISSN: 0885-6125; 1573-0565
• DOI: 10.1007/s10994-010-5224-5

This paper introduces a new ensemble approach, Feature-Subspace Aggregating (Feating), which builds local models instead of global models. Feating is a generic ensemble approach that can enhance the predictive performance of both stable and unstable learners. In contrast, most existing ensemble approaches can improve the predictive performance of unstable learners only. Our analysis shows that the new approach reduces the execution time to generate a model in an ensemble through an increased level of localisation in Feating. Our empirical evaluation shows that Feating performs significantly better than Boosting, Random Subspace and Bagging in terms of predictive accuracy, when a stable learner SVM is used as the base learner. The speed up achieved by Feating makes feasible SVM ensembles that would otherwise be infeasible for large data sets. When SVM is the preferred base learner, we show that Feating SVM performs better than Boosting decision trees and Random Forests. We further demonstrate that Feating also substantially reduces the error of another stable learner, k-nearest neighbour, and an unstable learner, decision tree.