Some Upper Bounds on Error Probability for Multiclass Pattern Recognition
暂无分享,去创建一个
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.
[1] T. Kailath. The Divergence and Bhattacharyya Distance Measures in Signal Selection , 1967 .
[2] Demetrios G. Lainiotis,et al. A class of upper bounds on probability of error for multihypotheses pattern recognition (Corresp.) , 1969, IEEE Trans. Inf. Theory.
[3] J. T. Chu,et al. Error Probability in Decision Functions for Character Recognition , 1967, JACM.