Nonnegative matrix factorization
[
因素n-通过-mmatrixW
,H
] = nnmf(A
,k
)A
into nonnegative factorsW
(n-通过-k
)和H
(k
-通过-m)。分解并不准确;W * H.
is a lower-rank approximation toA
。因素W
和H
最小化根均方差异D
之间A
和W * H.
。
d = norm(a - w * h,'fro'/ sqrt(n * m)
分组使用从随机初始值开始的迭代算法W
和H
。因为根均值均衡D
可能具有局部最小值,重复的因素可能会产生不同W
和H
。Sometimes the algorithm converges to a solution of lower rank thank, which can indicate that the result is not optimal.
[1] Berry,Michael W.,Murray Browne,Amy N. Langville,V.Paul Pauca和Robert J. Plemons。“近似非环境矩阵分解的算法和应用。”Computational Statistics & Data Analysis52, no. 1 (September 2007): 155–73.https://doi.org/10.1016/j.csda.2006.11.006。