Nonnegative matrix factorization and its applications in pattern recognition (Q871855): 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/s11434-005-1109-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2022978200 / rank
 
Normal rank

Revision as of 01:02, 20 March 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
    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
    0 references