SVD based initialization: A head start for nonnegative matrix factorization

DOI10.1016/j.patcog.2007.09.010zbMath1131.68084WikidataQ56533373 ScholiaQ56533373MaRDI QIDQ2469730

Christos Boutsidis, Efstratios Gallopoulos

Publication date: 7 February 2008

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2007.09.010

zbMATH Keywords

NMF; singular value decomposition; SVD; sparse factorization; nonnegative matrix factorization; Perron-Frobenius; low rank; sparse NMF; structured initialization

Mathematics Subject Classification ID

68U10: Computing methodologies for image processing

68T10: Pattern recognition, speech recognition

Related Items

Using underapproximations for sparse nonnegative matrix factorization, Algorithms and applications for approximate nonnegative matrix factorization, Parallel nonnegative matrix factorization algorithm on the distributed memory platform

Uses Software

• Matlab
• PROPACK
• TMG
• svdpack
• NMFLAB
• bioNMF

Cites Work

• Nonnegative ranks, decompositions, and factorizations of nonnegative matrices
• On reduced rank nonnegative matrix factorization for symmetric nonnegative matrices
• Nonnegative matrix factorization with constrained second-order optimization
• Algorithms and applications for approximate nonnegative matrix factorization
• Nonnegative matrix factorization for spectral data analysis
• Document clustering using nonnegative matrix factorization
• IRBL: An Implicitly Restarted Block-Lanczos Method for Large-Scale Hermitian Eigenproblems
• Learning the parts of objects by non-negative matrix factorization
• Concept decompositions for large sparse text data using clustering
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item