Pujol Vila, OriolRadeva, PetiaVitrià i Marca, Jordi2009-06-052009-06-0520060162-8828https://hdl.handle.net/2445/8522We 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.6 p.application/pdfeng(c) IEEE, 2006Matrius (Matemàtica)Reconeixement de formes (Informàtica)Teoria de la codificacióAnàlisi d'error (Matemàtica)Error correction codesMatrix algebraPattern classificationTrees (mathematics)info:eu-repo/semantics/article551282info:eu-repo/semantics/openAccess