The quality of training sample estimates of the Bhattacharyya coefficient

IEEE Transactions on Pattern Analysis and Machine IntelligencePublished 1 January 1990

A. Djouadi, Ogmundur Snorrason, Frederick Garber

DOI10.1109/34.41388

Source URL

Citations107

SJR quartileQ1

SJR score3.91

SNIP5.99

TL;DR

Abstract

The quality, in terms of the bias and variance, of estimates of the Bhattacharyya coefficient based on n training samples from two classes described by multivariate Gaussian distributions is considered. The case where the classes are described by a common covariance matrix, as well as the case where each class is described by a different covariance matrix, is analyzed. Expressions for the bias and the variance of estimates of the Bhattacharyya coefficient are derived, and numerical examples are used to show the relationship between these parameters, the number of training samples, and the dimensionality of the observation space.>

Keywords

MathematicsEngineering

Elsevier eBooksIntroduction to Statistical Pattern Recognition

11,121 Citations1990Keinosuke Fukunaga

A system to determine the sex of fish from their length, as accurately as possible, using a set of labelled data, together with the class label (male or female), as a training set.

IRE Transactions on Communications SystemsThe Divergence and Bhattacharyya Distance Measures in Signal Selection

1,844 Citations1967T. Kailath

This partly tutorial paper compares the properties of an often used measure, the divergence, with a new measure that is often easier to evaluate, called the Bhattacharyya distance, which gives results that are at least as good and often better than those given by the divergence.

Pattern RecognitionOn the optimal number of features in the classification of multivariate Gaussian data

119 Citations1978Anil K. Jain, W.G. Waller

This work considers the classification problem in the context of two equiprobable multivariate Gaussian densities with a common covariance matrix and provides expressions which relate p opt to the number of available training samples and the Mahalanobis distance between the two populations.

The Annals of Mathematical StatisticsErrors in Discrimination

93 Citations1961S. John

View PDF

IEEE Transactions on Systems Science and CyberneticsFeature Selection in Pattern Recognition

88 Citations1970K. S. Fu, P. Min +1 more

Computer similation results are presented and compared and feature selection techniques discussed include 1) information theoretic approach, 2) direct estimation of error probability, 3) feature-space transformation, and 4) approach of using stochastic automata model.

IEEE Transactions on Information TheoryA class of upper bounds on probability of error for multihypotheses pattern recognition (Corresp.)

65 Citations1969D.G. Lainiotis

A class of upper bounds on the probability of error for the general multihypotheses pattern recognition problem is obtained and an upper bound is shown to be a linear functional of the pairwise Bhattacharya coefficients.

IEEE Transactions on Pattern Analysis and Machine IntelligenceBounds on the Bayes classification error based on pairwise risk functions

26 Citations1988Frederick Garber, A. Djouadi

A method of computing upper and lower bounds on the pairwise Bayes risk for composite classes is developed and numerical examples of the application of the bounding techniques to a problem involving the classification of aircraft are discussed.

Time-domain and frequency-domain feature selection for reliable radar target identification

19 Citations2003Frederick Garber, Neil F. Chamberlain +1 more

Proceedings of the IEEEAn upper bound on the probability of misclassification in terms of the affinity

9 Citations1977Godfried T. Toussaint

A distribution-free upper bound is derived for the Bayes probability of misclassification in terms of Matusita's measure of affinity of several distributions for the multihypothesis pattern recognition problem.