We present a dedicated algorithm for the nonnegative factorization of a correlation matrix from an application in financial engineering. We look for a low-rank approximation. The origin of the problem is discussed in some detail. Next to the description of the algorithm, we prove, by means of a counter example, that an exact nonnegative decomposition of a general positive semidefinite matrix is not always available.
Abstract: A method based on elementary column and row operations of the factorization of nonnegative...
Given a symmetric matrix what is the nearest correlation matrix, that is, the nearest symmetric posi...
In this paper we consider the Nonnegative Matrix Factorization (NMF) problem: given an (elementwise)...
AbstractWe present a dedicated algorithm for the nonnegative factorization of a correlation matrix f...
AbstractThe nonnegative rank of a nonnegative matrix is the smallest number of nonnegative rank-one ...
The notion of low rank approximations arises from many important applications. When the low rank dat...
AbstractThe existence of nonnegative generalized inverses in terms of nonnegative rank factorization...
A method based on elementary column and row operations of the factorization of nonnegative matrices ...
In the Nonnegative Matrix Factorization (NMF) problem we are given an n×m nonnegative matrix M and a...
AbstractThe nonnegative rank of a nonnegative matrix is the smallest number of nonnegative rank-one ...
Nonnegative matrix factorization (NMF) has drawn considerable interest in recent years due to its im...
Nonnegative matrix factorization (NMF) has drawn considerable interest in recent years due to its im...
The exact nonnegative matrix factorization (exact NMF) problem is the following: given an m-by-n non...
Nonnegative matrix factorization (NMF) has drawn considerable interest in recent years due to its im...
Abstract. This paper introduces an algorithm for the nonnegative matrix factorization-and-completion...
Abstract: A method based on elementary column and row operations of the factorization of nonnegative...
Given a symmetric matrix what is the nearest correlation matrix, that is, the nearest symmetric posi...
In this paper we consider the Nonnegative Matrix Factorization (NMF) problem: given an (elementwise)...
AbstractWe present a dedicated algorithm for the nonnegative factorization of a correlation matrix f...
AbstractThe nonnegative rank of a nonnegative matrix is the smallest number of nonnegative rank-one ...
The notion of low rank approximations arises from many important applications. When the low rank dat...
AbstractThe existence of nonnegative generalized inverses in terms of nonnegative rank factorization...
A method based on elementary column and row operations of the factorization of nonnegative matrices ...
In the Nonnegative Matrix Factorization (NMF) problem we are given an n×m nonnegative matrix M and a...
AbstractThe nonnegative rank of a nonnegative matrix is the smallest number of nonnegative rank-one ...
Nonnegative matrix factorization (NMF) has drawn considerable interest in recent years due to its im...
Nonnegative matrix factorization (NMF) has drawn considerable interest in recent years due to its im...
The exact nonnegative matrix factorization (exact NMF) problem is the following: given an m-by-n non...
Nonnegative matrix factorization (NMF) has drawn considerable interest in recent years due to its im...
Abstract. This paper introduces an algorithm for the nonnegative matrix factorization-and-completion...
Abstract: A method based on elementary column and row operations of the factorization of nonnegative...
Given a symmetric matrix what is the nearest correlation matrix, that is, the nearest symmetric posi...
In this paper we consider the Nonnegative Matrix Factorization (NMF) problem: given an (elementwise)...