Generalizing the Mahalanobis distance via density kernels

The Mahalanobis distance ( MD) is a distance widely used in Statistics, Machine Learning and Pattern Recognition. When the data come from a Gaussian distribution, the MD uses the covariance matrix to evaluate the distance between a data point and the distribution mean. In this paper, we generalize the MD for general unimodal distributions, introducing a particular class of Mercer kernel, the density kernel, based on the underlying data density. Density kernels induce distances that generalize the MD and that are useful when data do not fit to the Gaussian distribution. We study the theoretical properties of the proposed distance and show its performance on a variety of artificial and real data analysis problems.

Generalizing the Mahalanobis distance via density kernels Articles