A Branch and Bound Algorithm for Feature Subset Selection
- 1 September 1977
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-26 (9) , 917-922
- https://doi.org/10.1109/tc.1977.1674939
Abstract
A feature subset selection algorithm based on branch and bound techniques is developed to select the best subset of m features from an n-feature set. Existing procedures for feature subset selection, such as sequential selection and dynamic programming, do not guarantee optimality of the selected feature subset. Exhaustive search, on the other hand, is generally computationally unfeasible. The present algorithm is very efficient and it selects the best subset without exhaustive search. Computational aspects of the algorithm are discussed. Results of several experiments demonstrate the very substantial computational savings realized. For example, the best 12-feature set from a 24-feature set was selected with the computational effort of evaluating only 6000 subsets. Exhaustive search would require the evaluation of 2 704 156 subsets.Keywords
This publication has 6 references indexed in Scilit:
- A Branch and Bound Clustering AlgorithmIEEE Transactions on Computers, 1975
- A Branch and Bound Algorithm for Computing k-Nearest NeighborsIEEE Transactions on Computers, 1975
- Dynamic programming as applied to feature subset selection in a pattern recognition systemPublished by Association for Computing Machinery (ACM) ,1972
- A Comparison of Seven Techniques for Choosing Subsets of Pattern Recognition PropertiesIEEE Transactions on Computers, 1971
- Branch-and-Bound Methods: A SurveyOperations Research, 1966
- Backtrack ProgrammingJournal of the ACM, 1965