Dynamic Programming as Applied to Feature Subset Selection in a Pattern Recognition System
Chieng-Yi Chang · IEEE Transactions on Systems Man and Cybernetics · 1973
This paper proposes dynamic programming search procedures to expedite the feature subset selection processes in a pattern recognition system. It is shown that in general the proposed procedures require much fewer subsets to be evaluated than the exhaustive search procedure. For example, a problem of selecting the best subset of 4 features from a set of 24 features requires an evaluation of (24/4) = 10626 subsets by using the exhaustive search procedure; on the other hand, it requires only 175 and 136 subsets to be considered by employing the proposed Procedures I and II, respectively, to solve the same problem. While the number of subsets to be evaluated for the dynamic programming search procedures is slightly greater than that for the without-replacement search procedure, the best feature subset selected by the proposed methods may, however, not necessarily contain all of the best single features selected in the previous stages.
Cited by 46 works. doi:10.1109/tsmc.1973.5408499
Authors
References
- Sequential Methods in Pattern Recognition and Machine Learning
- On the effectiveness of receptors in recognition systems
- A Direct Method of Nonparametric Measurement Selection
- A Comparison of Seven Techniques for Choosing Subsets of Pattern Recognition Properties
- Dynamic Programming and Modern Control Theory
- Feature Selection in Pattern Recognition
- A Dynamic Programming Approach to Sequential Pattern Recognition
- A Dynamic Programming Approach to the Selection of Pattern Features
- Sequential recognition using a nonparametric ranking procedure