Sub-classifier construction for error correcting output code using minimum weight perfect matching

Multi-class classification is mandatory for real world problems and one of promising techniques for multi-class classification is Error Correcting Output Code. We propose a method for constructing the Error Correcting Output Code to obtain the suitable combination of positive and negative classes encoded to represent binary classifiers. The minimum weight perfect matching algorithm is applied to find the optimal pairs of subset of classes by using the generalization performance as a weighting criterion. Based on our method, each subset of classes with positive and negative labels is appropriately combined for learning the binary classifiers. Experimental results show that our technique gives significantly higher performance compared to traditional methods including One-Versus-AU, the dense random code, and the sparse random code. Moreover, our method requires significantly smaller number of binary classifiers while maintaining accuracy compared to One-Versus-One.