Nonnegative rank factorization -- a heuristic approach via rank reduction (Q2248962): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11075-013-9704-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1985997397 / rank
 
Normal rank

Revision as of 01:35, 20 March 2024

scientific article
Language Label Description Also known as
English
Nonnegative rank factorization -- a heuristic approach via rank reduction
scientific article

    Statements

    Nonnegative rank factorization -- a heuristic approach via rank reduction (English)
    0 references
    0 references
    0 references
    0 references
    27 June 2014
    0 references
    Given the class of nonnegative \(m \times n\) matrices \(A\), with \(\mathrm{rank}(A)=\mathrm{rank}_+(A)=k\), where \(\mathrm{rank}_+(A)\) is the nonnegative rank of \(A\), the authors consider nonnegative rank factorizations (NRF), that is, factorizations \(A=UV\), where \(U\) and \(V\) are of dimensions \(m \times k\) and \(k \times n\), respectively. An algorithm for the NRF with a respective MATLAB code for such factorization is provided. Furthermore, some examples illustrate the presented method.
    0 references
    0 references
    nonnegative matrix
    0 references
    nonnegative rank
    0 references
    nonnegative matrix factorization
    0 references
    nonnegative rank factorization
    0 references
    numerical examples
    0 references
    algorithm
    0 references

    Identifiers