Nonnegative matrix factorization and its applications in pattern recognition (Q871855): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q29392476, #quickstatements; #temporary_batch_1706974296281
RedirectionBot (talk | contribs)
Removed claims
Property / author
 
Property / author: Nan-Ning Zheng / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Erich W. Ellers / rank
Normal rank
 

Revision as of 10:36, 10 February 2024

scientific article
Language Label Description Also known as
English
Nonnegative matrix factorization and its applications in pattern recognition
scientific article

    Statements

    Nonnegative matrix factorization and its applications in pattern recognition (English)
    0 references
    0 references
    0 references
    27 March 2007
    0 references
    Nonnegative matrix factorization (NMF) is a multivariate data analysis. Let \(X_{n\times m}\) be a data matrix with \(m\) samples in \(n\)-dimensional space, where all entries are nonnegative. Then \(X_{n\times m}\) can be decomposed into \(X_{n\times m}\approx B_{n\times r}C_{r\times m}\), where \(B_{n\times r}\) is called basis and \(C_{r\times m}\) is called coefficient matrix. Among many other things, the authors develop formulas for noise models and loss functions, they investigate local NMF and nonnegative space coding. They also deal with some practical questions of pattern recognition.
    0 references
    feature extraction
    0 references
    intrusion detection
    0 references
    digital watermarking
    0 references
    pattern recognition
    0 references
    nonnegative space coding
    0 references
    multivariate data analysis
    0 references
    nonnegative matrix factorization
    0 references

    Identifiers

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