The Bhattacharyya metric as an absolute similarity measure for frequency coded data
Kybernetika, Tome 34 (1998) no. 4, pp. 363-368 Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

This paper highlights advantageous properties of the Bhattacharyya metric over the chi-squared statistic for comparing frequency distributed data. The original interpretation of the Bhattacharyya metric as a geometric similarity measure is reviewed and it is pointed out that this derivation is independent of the use of the Bhattacharyya measure as an upper bound on the probability of misclassification in a two-class problem. The affinity between the Bhattacharyya and Matusita measures is described and we suggest use of the Bhattacharyya measure for comparing histogram data. We explain how the chi- squared statistic compensates for the implicit assumption of a Euclidean distance measure being the shortest path between two points in high dimensional space. By using the square-root transformation the Bhattacharyya metric requires no such standardization and by its multiplicative nature has no singularity problems (unlike those caused by the denominator of the chi- squared statistic) with zero count-data.
This paper highlights advantageous properties of the Bhattacharyya metric over the chi-squared statistic for comparing frequency distributed data. The original interpretation of the Bhattacharyya metric as a geometric similarity measure is reviewed and it is pointed out that this derivation is independent of the use of the Bhattacharyya measure as an upper bound on the probability of misclassification in a two-class problem. The affinity between the Bhattacharyya and Matusita measures is described and we suggest use of the Bhattacharyya measure for comparing histogram data. We explain how the chi- squared statistic compensates for the implicit assumption of a Euclidean distance measure being the shortest path between two points in high dimensional space. By using the square-root transformation the Bhattacharyya metric requires no such standardization and by its multiplicative nature has no singularity problems (unlike those caused by the denominator of the chi- squared statistic) with zero count-data.
Classification : 62B10, 62G99, 62H99, 68T99
Keywords: chi-square statistic
@article{KYB_1998_34_4_a1,
     author = {Aherne, Frank J. and Thacker, Neil A. and Rockett, Peter I.},
     title = {The {Bhattacharyya} metric as an absolute similarity measure for frequency coded data},
     journal = {Kybernetika},
     pages = {363--368},
     year = {1998},
     volume = {34},
     number = {4},
     mrnumber = {1658937},
     zbl = {1274.62058},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/KYB_1998_34_4_a1/}
}
TY  - JOUR
AU  - Aherne, Frank J.
AU  - Thacker, Neil A.
AU  - Rockett, Peter I.
TI  - The Bhattacharyya metric as an absolute similarity measure for frequency coded data
JO  - Kybernetika
PY  - 1998
SP  - 363
EP  - 368
VL  - 34
IS  - 4
UR  - http://geodesic.mathdoc.fr/item/KYB_1998_34_4_a1/
LA  - en
ID  - KYB_1998_34_4_a1
ER  - 
%0 Journal Article
%A Aherne, Frank J.
%A Thacker, Neil A.
%A Rockett, Peter I.
%T The Bhattacharyya metric as an absolute similarity measure for frequency coded data
%J Kybernetika
%D 1998
%P 363-368
%V 34
%N 4
%U http://geodesic.mathdoc.fr/item/KYB_1998_34_4_a1/
%G en
%F KYB_1998_34_4_a1
Aherne, Frank J.; Thacker, Neil A.; Rockett, Peter I. The Bhattacharyya metric as an absolute similarity measure for frequency coded data. Kybernetika, Tome 34 (1998) no. 4, pp. 363-368. http://geodesic.mathdoc.fr/item/KYB_1998_34_4_a1/

[1] Aherne F. J., Thacker N. A., Rockett P. I.: Optimal pairwise geometric histograms. In: Proc. 8th British Machine Vision Conf., Colchester 1997, pp. 480–490

[2] Bhattacharyya A.: On a measure of divergence between two statistical populations defined by their probability distributions. Bull. Calcutta Math. Soc. 35 (1943), 99–110 | MR | Zbl

[3] Christensen R.: Linear Models for Multivariate Time Series and Spatial Data. Springer–Verlag, New York 1991 | MR | Zbl

[4] Fukanaga K.: Introduction to Statistical Pattern Recognition. Second edition. Academic Press, New York 1990 | MR

[5] Matusita K.: Decision rules based on distance for problems of fit, two samples and estimation. Ann. Math. Statist. 26 (1955), 631–641 | DOI | MR

[6] Thacker N. A., Abraham, I., Courtney P. G.: Supervised learning extensions to the CLAM network. Neural Network J. 10 (1997), 2, 315–326 | DOI