A more efficient branch and bound algorithm for feature selection

Pattern Recognition

Volumn 26, Issue 6, 1993, Pages 883-889

  Yu, Bin ^a   Yuan, Baozong ^a  

^a BEIJING JIAOTONG UNIVERSITY   (China)

Author keywords

Combinatorial optimization; Feature selection; Pattern recognition; Solution tree

Indexed keywords

ALGORITHMS; IMAGE PROCESSING; OPTIMIZATION; SELECTION; SET THEORY; TREES (MATHEMATICS);

BRANCH AND BOUND ALGORITHM; COMBINATORIAL OPTIMIZATION; FEATURE SELECTION; SOLUTION TREES; STATISTICAL PATTERN RECOGNITION;

PATTERN RECOGNITION;

EID: 0027610652     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/0031-3203(93)90054-Z     Document Type: Article

References (8)

1. A comparison of seven techniques for choosing subsets of pattern recognition properties
2. Dynamic programming as applied to feature subset selection in a pattern recognition system
3. On selecting features for pattern classifiers
4. Feature set search algorithm
5. Best two independent measurements are not the two best
6. On the possible orderings in the measurement selection problem
7. A branch and bound algorithm for feature subset selection
8. A feature selection method for multiclass-set classification