| bibtype |
C -
Conference Paper (international conference)
|
| ARLID |
0106303 |
| utime |
20240103173133.5 |
| mtime |
20050324235959.9 |
| title
(primary) (eng) |
On prediction mechanisms in Fast Branch & Bound algorithms |
| specification |
|
| serial |
| title
|
Structural, Syntactic, and Statistical Pattern Recognition. Joint IAPR International Workshops SSPR 2004 and SPR 2004. Proceedings |
| page_num |
716-724 |
| ISBN |
3-540-22570-6 |
| publisher |
| place |
Berlin |
| name |
Springer |
| year |
2004 |
|
|
| title
(cze) |
Predikční mechanismy v rychlých Branch & Bound algoritmech |
| 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
|
| ARLID |
cav_un_auth*0101091 |
| name1 |
Grim |
| name2 |
Jiří |
| institution |
UTIA-B |
| full_dept |
Department of Pattern Recognition |
| fullinstit |
Ústav teorie informace a automatizace AV ČR, v. v. i. |
|
| source |
|
| 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 |
|
| research |
CEZ:AV0Z1075907 |
| abstract
(eng) |
The idea of using the Branch & Bound search for optimal feature selection has been recently refined by introducing additional predicting heuristics that is able to considerably accelerate the search process while keeping the optimality of results unaffected. In this paper we investigate alternative prediction mechanisms. The alternatives are shown useful for simplification and speed-up of the algorithm. We demonstrate the robustness of the prediction mechanism concept on real data experiments. |
| abstract
(cze) |
Princip využití metody Branch & Bound pro vyhledávaní optimální podmnožiny příznaků pro účely rozpoznávání byl nedávno zdokonalen pomocí heuristických predikčních mechanismů, které mohou značně urychlit proces vyhledávání bez omezení optimality výsledků. V článku jsou zkoumány různé možnosti predikce z hlediska zjednodušení a urychlení algoritmu. V experimentu na reálných datech byla potvrzena robustnost metody vyhledávání s využitím predikčního mechanismu |
| action |
| ARLID |
cav_un_auth*0129880 |
| name |
Joint IAPR Workshops SSPR 2004 and SPR 2004 |
| place |
Lisbon |
| dates |
18.08.2004-20.08.2004 |
| country |
PT |
|
| reportyear |
2005 |
| RIV |
BD |
| permalink |
http://hdl.handle.net/11104/0013485 |
| ID_orig |
UTIA-B 20040115 |
| arlyear |
2004 |
| mrcbU63 |
Structural, Syntactic, and Statistical Pattern Recognition. Joint IAPR International Workshops SSPR 2004 and SPR 2004. Proceedings 3-540-22570-6 716 724 Berlin Springer 2004 Lecture Notes in Computer Science. 3138 |
| mrcbU67 |
Fred A. 340 |
| mrcbU67 |
Caelli T. 340 |
| mrcbU67 |
Duin R. P. W. 340 |
|