0410452 20240103182215.020060210235959.9 980-07-6702-9 7 Computer Science and Engineering: Part I. Orlando IIIS 2000 6 s. 646-651SanchezB.PinedaM. J.WolfmannJ. cav_un_auth*0101197 Somol Petr UTIA-B Department of Pattern Recognition Ústav teorie informace a automatizace AV ČR, v. v. i. cav_un_auth*0101182 Pudil Pavel UTIA-B Department of Pattern Recognition Ústav teorie informace a automatizace AV ČR, v. v. i. cav_un_auth*0212022 Ferri F. J. ES cav_un_auth*0021087 Kittler J. GB http://library.utia.cas.cz/separaty/historie/somol-fast branch & bound algorithm in feature selection.pdf 09K 09H VS96063 MŠMT CZ cav_un_auth*0025066 ME 187 MŠMT CZ cav_un_auth*0028306 AV0Z1075907 A novel algorithm for optimal feature selection is presented which is much faster than classical Branch & Bound algorithm due to its simple mechanism for predicting criterion values. cav_un_auth*0212704 World Multiconference on Systemics, Cybernetics and Informatics /4./ Orlando US 23.07.2000-26.07.2000 JC RO http://hdl.handle.net/11104/0130541 UTIA-B 20000168 2000 2000 Orlando IIIS 980-07-6702-9 Proceedings of SCI 2000. The 4th World Multiconference on Systemics, Cybernetics and Informatics 646 651 Sanchez B. 340 Pineda M. J. 340 Wolfmann J. 340