By Topic

Adaptive Pattern Recognition with Random Costs and Its Application to Decision Trees

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)

Pattern recognition with unknown costs of classification is formulated as a problem of adaptively learning the optimal scheme starting from an ad hoc decision scheme. It is shown that unsupervised learning is adequate to compute converging estimates of the mean values of the MN random classification costs, one for each combination of M classes and N decisions. The quantities required for estimation are 1) the decision taken, 2) the outcome of the cost random variable corresponding to the unknown class and the implemented decision, and 3) the a posteriori probabilities of all the classes. Some of the variations of the above learning scheme are discussed. An application of the proposed methodology for adaptively improving the performance of pattern-recognition trees is presented along with simulation results.

Published in:

Systems, Man and Cybernetics, IEEE Transactions on  (Volume:16 ,  Issue: 2 )