Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

On the upper bound of the probability of error of a linear pattern classifier for probabilistic pattern classes

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)

Given a set of sample patterns for two pattern classes, some simple expressions for the upper bound of the probability of error for a linear pattern classifier and the optimal linear discriminant function minimizing the upper bound are obtained. Using these results, if the tolerable probability of error of classifying patterns in the two pattern classes is not smaller than this upper bound, not only a linear pattern classifier is known to be feasible, but also a satisfactory linear discriminant function is given. The results presented here are independent of the probability distribution of the patterns in the pattern classes. For some special cases, a smaller upper bound is found.

Published in:

Proceedings of the IEEE  (Volume:56 ,  Issue: 3 )