Nonnegative matrix factorization (NMF) is an increasingly popular technique for data processing and analysis.For an incomplete data matrix
the weighted nonnegative matrix factorization (WNMF) is employed to decompose it.But the searching step size in WNMF is not optimal along the given searching direction.This paper studies the incomplete nonnegative matrix factorization (INMF) and proposes an accelerated algorithm.First
INMF is transformed into solving alternatively two nonnegative least squares (NNLS) problems.For each NNLS problem
the exact step size is chosen along the searching direction.Then
the complexity of NNLS problems is analyzed.Finally
experimental results show that the proposed method outperforms WNMF.