This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Some Upper Bounds on Error Probability for Multiclass Pattern Recognition
August 1971 (vol. 20 no. 8)
pp. 943-944
G.T. Toussaint, Dep. Elec. Eng. Univ. British Columbia
An upper bound on the probability of error for the general pattern recognition problem is obtained as a functional of the pairwise Kolmogorov variational distances. Evaluation of the bound requires knowledge of a priori probabilities and of the class-conditional probability density functions. A tighter bound is obtained for the case of equal a priori probabilities, and a further bound is obtained that is independent of the a priori probabilities.
Citation:
G.T. Toussaint, "Some Upper Bounds on Error Probability for Multiclass Pattern Recognition," IEEE Transactions on Computers, vol. 20, no. 8, pp. 943-944, Aug. 1971, doi:10.1109/T-C.1971.223380
Usage of this product signifies your acceptance of the Terms of Use.