By Topic

An optimum finite sequential procedure for feature selection and pattern classification

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

2 Author(s)
Fu, K.S. ; Purdue University, Lafayette, IN, USA ; Cardillo, G.P.

In this paper a quite general formulation of sequential pattern recognition processes is presented. Within the framework of this formulation, a procedure is obtained for the simultaneous optimization of the stopping rule and the stage-by-stage ordering of features as the process proceeds. This optimization procedure is based on dynamic programming and uses as an index of performance the expected cost of the process, including both the cost of feature measurement and the cost of classification errors. A simple example illustrates the important computational aspects of the procedure and indicates the form of the solution.

Published in:

Automatic Control, IEEE Transactions on  (Volume:12 ,  Issue: 5 )