Classifier combination by Bayesian networks for handwriting recognition

In the field of handwriting recognition, classifier combination received much more inter- est than the study of powerful individual classifiers. This is mainly due to the enormous variability among the patterns to be classified, that typically requires the definition of complex high dimensional feature spaces: as the overall complexity increases, the risk of inconsistency in the decision of the classifier increases as well. In this framework, we propose a new combining method based on the use of a Bayesian Network. In particular, we suggest to reformulate the classifier combination problem as a pattern recognition one in which each input pattern is associated to a feature vector composed by the out- put of the classifiers to be combined. A Bayesian Network is then used to automatically infer the probability distribution for each class and eventually to perform the final clas- sification. Experiments have been performed by using two different pools of classifiers, namely an ensemble of Learning Vector Quantization neural networks and an ensemble of Back Propagation neural networks, and handwritten specimen from the UCI Machine Learning Repository. The obtained performance has been compared with those exhib- ited by multi-classifier systems adopting the classifiers, but three of the most effective and widely used combining rules: the Majority Vote, the Weighted Majority Vote and the Borda Count