4.7 Article

SVD based initialization: A head start for nonnegative matrix factorization

期刊

PATTERN RECOGNITION
卷 41, 期 4, 页码 1350-1362

出版社

ELSEVIER SCI LTD
DOI: 10.1016/j.patcog.2007.09.010

关键词

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

向作者/读者索取更多资源

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.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据