A Tight Upper Bound on the Bayesian Probability of Error

Authors:
W. A. Hashlamoun;P. K. Varshney;V. N. S. Samarasooriya
Affiliations:
-;-;-
Venue:
IEEE Transactions on Pattern Analysis and Machine Intelligence
Year:
1994

Citing 2
Cited 5

The Quality of Training Sample Estimates of the Bhattacharyya Coefficient

IEEE Transactions on Pattern Analysis and Machine Intelligence
Detection, Estimation, and Modulation Theory: Radar-Sonar Signal Processing and Gaussian Signals in Noise

Detection, Estimation, and Modulation Theory: Radar-Sonar Signal Processing and Gaussian Signals in Noise

Arbitrarily Tight Upper and Lower Bounds on the Bayesian Probability of Error

IEEE Transactions on Pattern Analysis and Machine Intelligence
Toward a tight upper bound for the error probability of the binary Gaussian classification problem

Pattern Recognition
Confidence intervals for probabilistic network classifiers

Computational Statistics & Data Analysis
Multiclass classification with potential function rules: Margin distribution and generalization

Pattern Recognition
Empirical bounds on error differences when using naive bayes

ICAPR'05 Proceedings of the Third international conference on Advances in Pattern Recognition - Volume Part I

Quantified Score

Hi-index	0.14

Visualization

Abstract

In this paper, we present a new upper bound on the minimum probability of error of Bayesian decision systems for statistical pattern recognition. This new bound is continuous everywhere and is shown to be tighter than several existing bounds such as the Bhattacharyya and the Bayesian bounds. Numerical results are also presented.