Branch & Bound algorithm with partial prediction for use with recursive and non-recursive criterion forms.
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985556%3A_____%2F01%3A16010229" target="_blank" >RIV/67985556:_____/01:16010229 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Branch & Bound algorithm with partial prediction for use with recursive and non-recursive criterion forms.
Original language description
We introduce a novel algorithm for optimal feature selection. As opposed to our recent Fast Branch & Bound (FBB) algorithm the new algorithm is well suitable for use with recursive criterion forms. Even if the new algorithm does not operate as effectively as the FBB algorithm, it is able to find the optimum significantly faster than any other Branch & Bound.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BD - Information theory
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2001
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Advances in Pattern Recognition - ICAPR 2001. Proceedings.
ISBN
3-540-41767-2
ISSN
—
e-ISSN
—
Number of pages
10
Pages from-to
425-434
Publisher name
Springer
Place of publication
Heidelberg
Event location
Rio de Janeiro [BR]
Event date
Mar 11, 2001
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—