By Topic

Dynamic Programming as Applied to Feature Subset Selection in a Pattern Recognition System

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Chang, Chieng-Yi ; Houston Aerospace Systems Division Lockheed Electronics Company, Houston, Tex. 77058.

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.

Published in:

Systems, Man and Cybernetics, IEEE Transactions on  (Volume:SMC-3 ,  Issue: 2 )