Incremental construction of classifier and discriminant ensembles

  • Authors:
  • Aydın Ulaş;Murat Semerci;Olcay Taner Yıldız;Ethem Alpaydın

  • Affiliations:
  • Department of Computer Engineering, Boğaziçi University, TR-34342 Bebek, Istanbul, Turkey;Department of Computer Science, Rensselaer Polytechnic Institute, 110 8th Street, Lally Hall, Troy, NY 12180-3590, USA;Department of Computer Engineering, Işık University, TR-34980 Şile, Istanbul, Turkey;Department of Computer Engineering, Boğaziçi University, TR-34342 Bebek, Istanbul, Turkey

  • Venue:
  • Information Sciences: an International Journal
  • Year:
  • 2009

Quantified Score

Hi-index 0.07

Visualization

Abstract

We discuss approaches to incrementally construct an ensemble. The first constructs an ensemble of classifiers choosing a subset from a larger set, and the second constructs an ensemble of discriminants, where a classifier is used for some classes only. We investigate criteria including accuracy, significant improvement, diversity, correlation, and the role of search direction. For discriminant ensembles, we test subset selection and trees. Fusion is by voting or by a linear model. Using 14 classifiers on 38 data sets, incremental search finds small, accurate ensembles in polynomial time. The discriminant ensemble uses a subset of discriminants and is simpler, interpretable, and accurate. We see that an incremental ensemble has higher accuracy than bagging and random subspace method; and it has a comparable accuracy to AdaBoost, but fewer classifiers.