DocumentCode
3716260
Title
Online nonnegative matrix factorization based on kernel machines
Author
Fei Zhu;Paul Honeine
Author_Institution
Institut Charles Delaunay (CNRS), Université
fYear
2015
Firstpage
2381
Lastpage
2385
Abstract
Nonnegative matrix factorization (NMF) has been increasingly investigated for data analysis and dimension-reduction. To tackle large-scale data, several online techniques for NMF have been introduced recently. So far, the online NMF has been limited to the linear model. This paper develops an online version of the nonlinear kernel-based NMF, where the decomposition is performed in the feature space. Taking the advantage of the stochastic gradient descent and the mini-batch scheme, the proposed method has a fixed, tractable complexity independent of the increasing samples number. We derive the multiplicative update rules of the general form, and describe in detail the case of the Gaussian kernel. The effectiveness of the proposed method is validated on unmixing hyperspectral images, compared with the state-of-the-art online NMF methods.
Keywords
"Kernel","Encoding","Linear programming","Europe","Signal processing","Stochastic processes","Computational complexity"
Publisher
ieee
Conference_Titel
Signal Processing Conference (EUSIPCO), 2015 23rd European
Electronic_ISBN
2076-1465
Type
conf
DOI
10.1109/EUSIPCO.2015.7362811
Filename
7362811
Link To Document