Hamamoto, Yoshihiko; Uchimura, Shunji; Matsuura, Yutaka; Kanaoka, Taiho; Tomita, Shingo Evaluation of the branch and bound algorithm for feature selection. (English) Zbl 0941.68722 Pattern Recognit. Lett. 11, No. 7, 453-456 (1990). Summary: Narendra and Fukunaga show that the branch and bound algorithm guarantees the optimal feature subset without evaluating all possible feature subsets, if the criterion function used satisfies the ‘monotonicity’ property. In this paper, we show that the algorithm works well in terms of the recognition rate, even if the property is not satisfied. Cited in 2 Documents MSC: 68T10 Pattern recognition, speech recognition 90C57 Polyhedral combinatorics, branch-and-bound, branch-and-cut Keywords:feature selection; branch and bound algorithm; exhaustive search algorithm; recognition rate PDFBibTeX XMLCite \textit{Y. Hamamoto} et al., Pattern Recognit. Lett. 11, No. 7, 453--456 (1990; Zbl 0941.68722) Full Text: DOI