|
|
|
|
LEADER |
01000naa a22002652 4500 |
001 |
NLM163035970 |
003 |
DE-627 |
005 |
20231223095509.0 |
007 |
tu |
008 |
231223s2006 xx ||||| 00| ||eng c |
028 |
5 |
2 |
|a pubmed24n0544.xml
|
035 |
|
|
|a (DE-627)NLM163035970
|
035 |
|
|
|a (NLM)16724594
|
040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
041 |
|
|
|a eng
|
100 |
1 |
|
|a Pujol, Oriol
|e verfasserin
|4 aut
|
245 |
1 |
0 |
|a Discriminant ECOC
|b a heuristic method for application dependent design of error correcting output codes
|
264 |
|
1 |
|c 2006
|
336 |
|
|
|a Text
|b txt
|2 rdacontent
|
337 |
|
|
|a ohne Hilfsmittel zu benutzen
|b n
|2 rdamedia
|
338 |
|
|
|a Band
|b nc
|2 rdacarrier
|
500 |
|
|
|a Date Completed 20.06.2006
|
500 |
|
|
|a Date Revised 10.12.2019
|
500 |
|
|
|a published: Print
|
500 |
|
|
|a Citation Status MEDLINE
|
520 |
|
|
|a 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
|
650 |
|
4 |
|a Evaluation Study
|
650 |
|
4 |
|a Journal Article
|
650 |
|
4 |
|a Research Support, Non-U.S. Gov't
|
700 |
1 |
|
|a Radeva, Petia
|e verfasserin
|4 aut
|
700 |
1 |
|
|a Vitrià, Jordi
|e verfasserin
|4 aut
|
773 |
0 |
8 |
|i Enthalten in
|t IEEE transactions on pattern analysis and machine intelligence
|d 1979
|g 28(2006), 6 vom: 06. Juni, Seite 1007-12
|w (DE-627)NLM098212257
|x 1939-3539
|7 nnns
|
773 |
1 |
8 |
|g volume:28
|g year:2006
|g number:6
|g day:06
|g month:06
|g pages:1007-12
|
912 |
|
|
|a GBV_USEFLAG_A
|
912 |
|
|
|a SYSFLAG_A
|
912 |
|
|
|a GBV_NLM
|
912 |
|
|
|a GBV_ILN_350
|
951 |
|
|
|a AR
|
952 |
|
|
|d 28
|j 2006
|e 6
|b 06
|c 06
|h 1007-12
|