Solving the pre-image problem in kernel machines: a direct method - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2009

Solving the pre-image problem in kernel machines: a direct method

Résumé

In this paper, we consider the pre-image problem in kernel machines, such as denoising with kernel-PCA. For a given reproducing kernel Hilbert space (RKHS), by solving the pre-image problem one seeks a pattern whose image in the RKHS is approximately a given feature. Traditional techniques include an iterative technique (Mika et al.) and a multidimensional scaling (MDS) approach (Kwok et al.). In this paper, we propose a new technique to learn the pre-image. In the RKHS, we construct a basis having an isometry with the input space, with respect to a training data. Then representing any feature in this basis gives us information regarding its pre-image in the input space. We show that doing a pre-image can be done directly using the kernel values, without having to compute distances in any of the spaces as with the MDS approach. Simulation results illustrates the relevance of the proposed method, as we compare it to these techniques.
Fichier principal
Vignette du fichier
09.mlsp.pdf (653.49 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01966049 , version 1 (27-12-2018)

Identifiants

Citer

Paul Honeine, Cédric Richard. Solving the pre-image problem in kernel machines: a direct method. Proc. 19th IEEE workshop on Machine Learning for Signal Processing (MLSP), 2009, Grenoble, France. pp.1-6, ⟨10.1109/MLSP.2009.5306204⟩. ⟨hal-01966049⟩
35 Consultations
165 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More