Applying Pairwise Fusion Matrix on Fusion Functions for Classifier Combination

摘要

We propose a new classifier combination scheme for the ensemble of classifiers. The Pairwise Fusion Matrix (PFM) constructs confusion matrices based on classifier pairs and thus offers the estimated probability of each class based on each classifier pair. These probability outputs can then be combined and the final outputs of the ensemble of classifiers is reached using various fusion functions. The advantage of this approach is the flexibility of the choice of the fusion functions, and the experiments suggest that the PFM combined with the majority voting outperforms the simple majority voting scheme on most of problems.