| bibtype |
J -
Journal Article
|
| ARLID |
0106281 |
| utime |
20240103173131.7 |
| mtime |
20050324235959.9 |
| title
(primary) (eng) |
Fast Branch & Bound algorithms for optimal feature selection |
| specification |
|
| serial |
| ARLID |
cav_un_epca*0256725 |
| ISSN |
0162-8828 |
| title
|
IEEE Transactions on Pattern Analysis and Machine Intelligence |
| volume_id |
26 |
| volume |
7 (2004) |
| page_num |
900-912 |
| publisher |
| name |
IEEE Computer Society |
|
|
| title
(cze) |
Rychlé algoritmy větví a mezí pro optimální výběr příznaků |
| keyword |
subset search |
| keyword |
feature selection |
| keyword |
search tree |
| author
(primary) |
| ARLID |
cav_un_auth*0101197 |
| name1 |
Somol |
| name2 |
Petr |
| institution |
UTIA-B |
| full_dept |
Department of Pattern Recognition |
| fullinstit |
Ústav teorie informace a automatizace AV ČR, v. v. i. |
|
| author
|
| ARLID |
cav_un_auth*0101182 |
| name1 |
Pudil |
| name2 |
Pavel |
| institution |
UTIA-B |
| full_dept |
Department of Pattern Recognition |
| fullinstit |
Ústav teorie informace a automatizace AV ČR, v. v. i. |
|
| author
|
| name1 |
Kittler |
| name2 |
J. |
| country |
GB |
| ARLID |
cav_un_auth*0021087 |
|
| COSATI |
09J |
| COSATI |
09K |
| cas_special |
| project |
| project_id |
GA402/02/1271 |
| agency |
GA ČR |
| ARLID |
cav_un_auth*0008983 |
|
| project |
| project_id |
GA402/03/1310 |
| agency |
GA ČR |
| ARLID |
cav_un_auth*0009030 |
|
| project |
| project_id |
KSK1019101 |
| agency |
GA AV ČR |
| ARLID |
cav_un_auth*0000219 |
|
| research |
CEZ:AV0Z1075907 |
| abstract
(eng) |
A novel search principle for optimal feature subset selection using the Branch & Bound method is introduced. Thanks to a simple mechanism for predicting criterion values, a considerable amount of computational time can be saved. We propose two implementations of the proposed prediction mechanism that are suitable for use with nonrecursive and recursive criterion forms, respectively. We also investigate other factors that affect the search performance of all Branch & Bound algorithms. |
| abstract
(cze) |
Nový hledací princip pro optimální výběr příznaků za pomoci metody větví a mezí je prezentován. Díky jednoduchému mechanizmu predikce hodnot kritéria, lze ušetřit podstatnou část výpočetního času. Navrhujeme dvě implementace predikčního mechanizmu vhodné pro nerekurzivní a rekurzivní formy kritéria. Dále zkoumáme další faktory které ovlivňují výkonnost všech algoritmů větví a mezí |
| reportyear |
2005 |
| RIV |
BD |
| permalink |
http://hdl.handle.net/11104/0013463 |
| ID_orig |
UTIA-B 20040093 |
| arlyear |
2004 |
| mrcbU63 |
cav_un_epca*0256725 IEEE Transactions on Pattern Analysis and Machine Intelligence 0162-8828 1939-3539 Roč. 26 č. 7 2004 900 912 IEEE Computer Society |
|