Journal
INTERNATIONAL JOURNAL OF NEURAL SYSTEMS
Volume 17, Issue 6, Pages 431-446Publisher
WORLD SCIENTIFIC PUBL CO PTE LTD
DOI: 10.1142/S0129065707001275
Keywords
nonnegative matrix factorization; NMF; multilayer NMF; projected gradient algorithms; BSS
Categories
Ask authors/readers for more resources
The most popular algorithms for Nonnegative Matrix Factorization (NMF) belong to a class of multiplicative Lee-Seung algorithms which have usually relative low complexity but are characterized by slow-convergence and the risk of getting stuck to in local minima. In this paper, we present and compare the performance of additive algorithms based on three different variations of a projected gradient approach. Additionally, we discuss a novel multilayer approach to NMF algorithms combined with multistart initializations procedure, which in general, considerably improves the performance of all the NMF algorithms. We demonstrate that this approach (the multilayer system with projected gradient algorithms) can usually give much better performance than standard multiplicative algorithms, especially, if data are ill-conditioned, badly-scaled, and/or a number of observations is only slightly greater than a number of nonnegative hidden components. Our new implementations of NMF are demonstrated with the simulations performed for Blind Source Separation (BSS) data.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available