Reranking for stacking ensemble learning

  • Authors:
  • Buzhou Tang;Qingcai Chen;Xuan Wang;Xiaolong Wang

  • Affiliations:
  • Harbin Institute of Technology Shenzhen Graduate School, Computer Science Department, Shenzhen, China;Harbin Institute of Technology Shenzhen Graduate School, Computer Science Department, Shenzhen, China;Harbin Institute of Technology Shenzhen Graduate School, Computer Science Department, Shenzhen, China;Harbin Institute of Technology Shenzhen Graduate School, Computer Science Department, Shenzhen, China

  • Venue:
  • ICONIP'10 Proceedings of the 17th international conference on Neural information processing: theory and algorithms - Volume Part I
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Ensemble learning refers to the methods that combine multiple models to improve the performance. Ensemble methods, such as stacking, have been intensively studied, and can bring slight performance improvement. However, there is no guarantee that a stacking algorithm outperforms all base classifiers. In this paper, we propose a new stacking algorithm, where the predictive scores of each possible class label returned by the base classifiers are firstly collected by the meta-learner, and then all possible class labels are reranked according to the scores. This algorithm is able to find the best linear combination of the base classifiers on the training samples, which make sure it outperforms all base classifiers during training process. The experiments conducted on several public datasets show that the proposed algorithm outperforms the baseline algorithms and several state-of-the-art stacking algorithms.