Bagging Ensemble Selection

  • Quan Sun
  • Bernhard Pfahringer
Conference paper

DOI: 10.1007/978-3-642-25832-9_26

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7106)
Cite this paper as:
Sun Q., Pfahringer B. (2011) Bagging Ensemble Selection. In: Wang D., Reynolds M. (eds) AI 2011: Advances in Artificial Intelligence. AI 2011. Lecture Notes in Computer Science, vol 7106. Springer, Berlin, Heidelberg

Abstract

Ensemble selection has recently appeared as a popular ensemble learning method, not only because its implementation is fairly straightforward, but also due to its excellent predictive performance on practical problems. The method has been highlighted in winning solutions of many data mining competitions, such as the Netflix competition, the KDD Cup 2009 and 2010, the UCSD FICO contest 2010, and a number of data mining competitions on the Kaggle platform. In this paper we present a novel variant: bagging ensemble selection. Three variations of the proposed algorithm are compared to the original ensemble selection algorithm and other ensemble algorithms. Experiments with ten real world problems from diverse domains demonstrate the benefit of the bagging ensemble selection algorithm.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Quan Sun
    • 1
  • Bernhard Pfahringer
    • 1
  1. 1.Department of Computer ScienceThe University of WaikatoHamiltonNew Zealand

Personalised recommendations