Answers are grounded in this paper and cite their sources.
We present a heuristic method for learning error correcting output codes matrices based on a hierarchical partition of the class space that maximizes a discriminative criterion. To achieve this goal, the optimal codeword separation is sacrificed in favor of a maximum class discrimination in the partitions. The creation of the hierarchical partition set is performed using a binary tree. As a result, a compact matrix with high discrimination power is obtained. Our method is validated using the UCI database and applied to a real problem, the classification of traffic sign images.
No takes yet. Share an insight, caveat, or question.
Pujol et al. (2006) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: