On deriving the second-stage training set for trainable combiners

  • Authors:
  • Pavel Paclík;Thomas C. W. Landgrebe;David M. J. Tax;Robert P. W. Duin

  • Affiliations:
  • Information and Communication Theory Group, TU Delft, The Netherlands;Information and Communication Theory Group, TU Delft, The Netherlands;Information and Communication Theory Group, TU Delft, The Netherlands;Information and Communication Theory Group, TU Delft, The Netherlands

  • Venue:
  • MCS'05 Proceedings of the 6th international conference on Multiple Classifier Systems
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Unlike fixed combining rules, the trainable combiner is applicable to ensembles of diverse base classifier architectures with incomparable outputs. The trainable combiner, however, requires the additional step of deriving a second-stage training dataset from the base classifier outputs. Although several strategies have been devised, it is thus far unclear which is superior for a given situation. In this paper we investigate three principal training techniques, namely the re-use of the training dataset for both stages, an independent validation set, and the stacked generalization. On experiments with several datasets we have observed that the stacked generalization outperforms the other techniques in most situations, with the exception of very small sample sizes, in which the re-using strategy behaves better. We illustrate that the stacked generalization introduces additional noise to the second-stage training dataset, and should therefore be bundled with simple combiners that are insensitive to the noise. We propose an extension of the stacked generalization approach which significantly improves the combiner robustness.