Branch & bound algorithm with partial prediction for use with recursive and non-recursive criterion forms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2013, Issue , 2001, Pages 230-239

  Somol, Petr ^a   Pudil, Pavel ^a   Grim, Jirí ^a  

^a INSTITUTE OF INFORMATION THEORY AND AUTOMATION   (Czech Republic)

Author keywords

Feature selection; Optimal search; Recursive crite ria; Search tree; Subset search; Subset selection

Indexed keywords

FEATURE EXTRACTION; PATTERN RECOGNITION;

OPTIMAL SEARCH; RECURSIVE CRITE-RIA; SEARCH TREES; SUBSET SEARCHES; SUBSET SELECTION;

ALGORITHMS;

EID: 3042566106     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (5)

1. Narendra P. M., Fukunaga K. (1977) A branch and bound algorithm for feature subset selection. IEEE Transactions on Computers, C-26, 917-922
2. Devijver P. A., Kittler J. (1982) Pattern Recognition: A Statistical Approach. Prentice-Hall
3. Fukunaga K. (1990) Introduction to Statistical Pattern Recognition: 2nd edition. Academic Press, Inc.
4. Yu B., Yuan B. (1993) A more eficient branch and bound algorithm for feature selection. Pattern Recognition, 26, 883-889
5. Somol P., Pudil P., Ferri F. J., Kittler J. (2000) Fast Branch & Bound Algorithm in Feature Selection. Proc 4th World Multiconference on Systemics, Cybernetics and Informatics SCI 2000, Orlando, Florida, Vol VII, Part 1, 646-651