Introducing a weighted non-negative matrix factorization for image classification
Pattern Recognition Letters
Non-negative matrix factorization based methods for object recognition
Pattern Recognition Letters
CSB '04 Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference
Nonnegative features of spectro-temporal sounds for classification
Pattern Recognition Letters
Nonsmooth Nonnegative Matrix Factorization (nsNMF)
IEEE Transactions on Pattern Analysis and Machine Intelligence
Learning Image Components for Object Recognition
The Journal of Machine Learning Research
Fast nonnegative matrix factorization and its application for protein fold recognition
EURASIP Journal on Applied Signal Processing
Projected Gradient Methods for Nonnegative Matrix Factorization
Neural Computation
SIAM Journal on Matrix Analysis and Applications
Computational Intelligence and Neuroscience - Advances in Nonnegative Matrix and Tensor Factorization
Non-negative matrix factorization with quasi-newton optimization
ICAISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Soft Computing
On the Convergence of Multiplicative Update Algorithms for Nonnegative Matrix Factorization
IEEE Transactions on Neural Networks
Hi-index | 0.00 |
Non-negative matrix factorization (NMF) is a method to obtain a representation of data using non-negativity constraints. A popular approach is alternating non-negative least squares (ANLS). As is well known, if the sequence generated by ANLS has at least one limit point, then the limit point is a stationary point of NMF. However, no evdience has shown that the sequence generated by ANLS has at least one limit point. In order to overcome this shortcoming, we propose a modified strategy for ANLS in this paper. The modified strategy can ensure the sequence generated by ANLS has at least one limit point, and this limit point is a stationary point of NMF. The results of numerical experiments are reported to show the effectiveness of the proposed algorithm.