About nonnegative matrix factorization: On the posrank approximation

2Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This work addresses the concept of nonnegative matrix factorization (NMF). Some relevant issues for its formulation as as a non-linear 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. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

De Almeida, A. (2011). About nonnegative matrix factorization: On the posrank approximation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6594 LNCS, pp. 295–304). https://doi.org/10.1007/978-3-642-20267-4_31

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free