By Topic

The mean accuracy of pattern recognizers with many pattern classes (Corresp.)

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)

Hughes [1] presented some curves relating the mean performance of a pattern classifier averaged over all pattern recognition problems of given complexity, when there are two classes of patterns to be distinguished. In this correspondence the mean recognition probability is computed for the case of q pattern classes when the a priori probabilities of the classes are equal. When the a priori probabilities are unequal, the mean performance will improve over the performance with equal a priori probabilities, so these curves provide a lower bound to the performance of recognizers with more than two pattern classes. Some comments on the appropriateness of these statistics to common recognition problems are made.

Published in:

Information Theory, IEEE Transactions on  (Volume:15 ,  Issue: 3 )