A Branch and Bound Algorithm for Feature Subset Selection
Narendra, Fukunaga · IEEE Transactions on Computers · 1977
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.
Cited by 1,245 works. doi:10.1109/tc.1977.1674939
Authors
References
- Linear Statistical Inference and its Applications
- Introduction to Statistical Pattern Recognition
- Branch-and-Bound Methods: A Survey
- Backtrack Programming
- Linear Statistical Inference and Its Applications
- A Branch and Bound Algorithm for Computing k-Nearest Neighbors
- A Comparison of Seven Techniques for Choosing Subsets of Pattern Recognition Properties
- A Branch and Bound Clustering Algorithm
- Dynamic Programming as Applied to Feature Subset Selection in a Pattern Recognition System
- Dynamic programming as applied to feature subset selection in a pattern recognition system