Pareto front of bi-objective kernel-based nonnegative matrix factorization - Archive ouverte HAL
Communication Dans Un Congrès Année : 2015

Pareto front of bi-objective kernel-based nonnegative matrix factorization

Résumé

The nonnegative matrix factorization (NMF) is a powerful data analysis and dimensionality reduction technique. So far, the NMF has been limited to a single-objective problem in either its linear or nonlinear kernel-based formulation. This paper presents a novel bi-objective NMF model based on kernel machines, where the decomposition is performed simultaneously in both input and feature spaces. The problem is solved employing the sum-weighted approach. Without loss of generality, we study the case of the Gaussian kernel, where the multiplicative update rules are derived and the Pareto front is approximated. The performance of the proposed method is demonstrated for unmixing hyperspectral images
Fichier principal
Vignette du fichier
15.esann.nmf.pdf (131.94 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

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

Identifiants

  • HAL Id : hal-01965982 , version 1

Citer

Fei Zhu, Paul Honeine. Pareto front of bi-objective kernel-based nonnegative matrix factorization. Proc. 23rd European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning (ESANN), 2015, Bruges, Belgium. pp.585 - 590. ⟨hal-01965982⟩
56 Consultations
35 Téléchargements

Partager

More