Rank selection in nonnegative matrix factorization using minimum description length

DOI10.1162/NECO_A_00980MaRDI QIDQ5380834zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Steven Squires, A. Prügel-Bennett, Mahesan Niranjan

Publication date 6 June 2019

Published in Neural Computation (Search for Journal in Brave)

Full work available at URL https://eprints.soton.ac.uk/413094/1/NeuralComputationMDLPostReviews.pdf

zbMATH Keywords

matrix factorizationrank selection

Mathematics Subject Classification ID

Statistical ranking and selection procedures (62F07) Characterization and structure theory for multivariate probability distributions; copulas (62H05) Factorization of matrices (15A23)

Recommendations

• Non-negative matrix factorization with sparseness constraints
• The nonnegative matrix factorization: regularization and complexity
• Algorithms and applications for approximate nonnegative matrix factorization
• Fast nonnegative matrix factorization: an active-set-like method and comparisons
• Nonnegative matrix factorization and its applications in pattern recognition

Cites work

• scientific article; zbMATH DE number 2061729 (Why is no real title available?)
• An Information Measure for Classification
• Bi-cross-validation of the SVD and the nonnegative matrix factorization
• Learning the parts of objects by non-negative matrix factorization
• Non-negative matrix factorization with sparseness constraints

Cited in

(4)

• Rank selection for non-negative matrix factorization
• Non-negative matrix factorization with sparseness constraints
• Leveraging maximum entropy and correlation on latent factors for learning representations
• The nonnegative matrix factorization: regularization and complexity

Describes a project that uses

Uses Software

• Matlab

This page was built for publication: Rank selection in nonnegative matrix factorization using minimum description length

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5380834)