Journal
PATTERN RECOGNITION
Volume 41, Issue 4, Pages 1350-1362Publisher
ELSEVIER SCI LTD
DOI: 10.1016/j.patcog.2007.09.010
Keywords
NMF; sparse NMF; SVD; nonnegative matrix factorization; singular value decomposition; Perron-Frobenius; low rank; structured initialization; sparse factorization
Ask authors/readers for more resources
We describe Nonnegative Double Singular Value Decomposition (NNDSVD), a new method designed to enhance the initialization stage of nonnegative matrix factorization (NMF). NNDSVD can readily be combined with existing NMF algorithms. The basic algorithm contains no randomization and is based on two SVD processes, one approximating the data matrix, the other approximating positive sections of the resulting partial SVD factors utilizing an algebraic property of unit rank matrices. Simple practical variants for NMF with dense factors are described. NNDSVD is also well suited to initialize NMF algorithms with sparse factors. Many numerical examples suggest that NNDSVD leads to rapid reduction of the approximation error of many NMF algorithms. (c) 2007 Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available