Bhattacharya Distance Function

From GM-RKB
Jump to navigation Jump to search

A Bhattacharya Distance Function is a probability distribution similarity measure between populations with probability density functions [math]\displaystyle{ f }[/math] and [math]\displaystyle{ g }[/math] given by [math]\displaystyle{ cos^{-1} \bigg( \int_{-\infty}^\infty \{ f(x)g(x)\}^{\frac{1}{2} } dx \bigg) }[/math]



References

2015

  • (Wikipedia, 2015) ⇒ http://en.wikipedia.org/wiki/Bhattacharyya_distance Retrieved:2015-1-9.
    • In statistics, the Bhattacharyya distance measures the similarity of two discrete or continuous probability distributions. It is closely related to the Bhattacharyya coefficient which is a measure of the amount of overlap between two statistical samples or populations. Both measures are named after Anil Kumar Bhattacharya, a statistician who worked in the 1930s at the Indian Statistical Institute. The coefficient can be used to determine the relative closeness of the two samples being considered. It is used to measure the separability of classes in classification and it is considered to be more reliable than the Mahalanobis distance, as the Mahalanobis distance is a particular case of the Bhattacharyya distance when the standard deviations of the two classes are the same. Therefore, when two classes have similar means but different standard deviations, the Mahalanobis distance would tend to zero, however, the Bhattacharyya distance would grow depending on the difference between the standard deviations.

2008