On the Complexity of Nonnegative Matrix Factorization (Q3586139)

From MaRDI portal
Revision as of 04:06, 5 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
On the Complexity of Nonnegative Matrix Factorization
scientific article

    Statements

    On the Complexity of Nonnegative Matrix Factorization (English)
    0 references
    0 references
    6 September 2010
    0 references
    complexity
    0 references
    nonnegative matrix factorization
    0 references
    NP hard
    0 references
    nonnegative rank
    0 references
    data mining
    0 references
    database analysis, information retrieval
    0 references
    local search heuristic
    0 references
    linear programming
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references