About nonnegative matrix factorization: on the posrank approximation

Authors:
Ana de Almeida
Affiliations:
Center for Informatics and Systems, University of Coimbra, Portugal
Venue:
ICANNGA'11 Proceedings of the 10th international conference on Adaptive and natural computing algorithms - Volume Part II
Year:
2011

Citing 4
Cited 0

Non-negative Matrix Factorization with Sparseness Constraints

The Journal of Machine Learning Research
Nonsmooth Nonnegative Matrix Factorization (nsNMF)

IEEE Transactions on Pattern Analysis and Machine Intelligence
Projected Gradient Methods for Nonnegative Matrix Factorization

Neural Computation
Nonnegative Matrix and Tensor Factorizations: Applications to Exploratory Multi-way Data Analysis and Blind Source Separation

Nonnegative Matrix and Tensor Factorizations: Applications to Exploratory Multi-way Data Analysis and Blind Source Separation

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work addresses the concept of nonnegative matrix factorization (NMF). Some relevant issues for its formulation as as a nonlinear optimization problem will be discussed. The primary goal of NMF is that of obtaining good quality approximations, namely for video/image visualization. The importance of the rank of the factor matrices and the use of global optimization techniques is investigated. Some computational experience is reported indicating that, in general, the relation between the quality of the obtained local minima and the factor matrices dimensions has a strong impact on the quality of the solutions associated with the decomposition.