Evaluation of the branch and bound algorithm for feature selection

Pattern Recognition Letters

Volumn 11, Issue 7, 1990, Pages 453-456

  Hamamoto, Yoshihiko ^a   Uchimura, Shunji ^b   Matsuura, Yutaka ^a   Kanaoka, Taiho ^a   Tomita, Shingo ^a  

^a YAMAGUCHI UNIVERSITY   (Japan)

^b OSHIMA NATIONAL COLLEGE OF MARITIME TECHNOLOGY   (Japan)

Author keywords

bound algorithm; branch; exhaustive search algorithm; Feature selection; recognition rate

Indexed keywords

BRANCH AND BOUND ALGORITHM; FEATURE SELECTION;

EID: 0025656660     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/0167-8655(90)90078-G     Document Type: Article

References (8)

1. The use of faces to represent points in k-dimensional space graphically
2. On the possible orderings in the measurement selection problem
3. The use of multiple measurements in taxonomic problems
4. Feature selection for automatic classification of non-gaussian data
5. Feature selection in pattern recognition
6. On the mean accuracy of statistical pattern recognizers
7. On the effectiveness of receptors in recognition systems
8. A branch and bound algorithm for feature subset selection