Sciweavers

Share
DAGM
2011
Springer

Relaxed Exponential Kernels for Unsupervised Learning

10 years 11 months ago
Relaxed Exponential Kernels for Unsupervised Learning
Many unsupervised learning algorithms make use of kernels that rely on the Euclidean distance between two samples. However, the Euclidean distance is optimal for Gaussian distributed data. In this paper, we relax the global Gaussian assumption made by the Euclidean distance, and propose a locale Gaussian modelling for the immediate neighbourhood of the samples, resulting in an augmented data space formed by the parameters of the local Gaussians. To this end, we propose a convolution kernel for the augmented data space. The factorisable nature of this kernel allows us to introduce (semi)-metrics for this space, which further derives relaxed versions of known kernels for this space. We present empirical results to validate the utility of the proposed localized approach in the context of spectral clustering. The key result of this paper is that this approach that combines the local Gaussian model with measures that adhere to metric properties, yields much better performance in different ...
Karim T. Abou-Moustafa, Mohak Shah, Fernando De la
Added 18 Dec 2011
Updated 18 Dec 2011
Type Journal
Year 2011
Where DAGM
Authors Karim T. Abou-Moustafa, Mohak Shah, Fernando De la Torre, Frank P. Ferrie
Comments (0)
books