On the Complexity of Nonnegative Matrix Factorization (Q3586139)

From MaRDI portal
Revision as of 07:24, 13 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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