Abstract
The Mahalanobis distance (MD) is a widely used measure in Statistics and Pattern Recognition. Interestingly, assuming that the data are generated from a Gaussian distribution, it considers the covariance matrix to evaluate the distance between a data point and the distribution mean. In this work, we generalize MD for distributions in the exponential family, providing both, a definition in terms of the data density function and a computable version. We show its performance on several artificial and real data scenarios. © Springer-Verlag 2013.
Cite
CITATION STYLE
Martos, G., Munõz, A., & Gonzaĺez, J. (2013). On the generalization of the mahalanobis distance. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8258 LNCS, pp. 125–132). https://doi.org/10.1007/978-3-642-41822-8_16
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.