A Two-Point Step Size Gradient method forNon-negative Matrix Factorization
Nonnegative Matrix Factorization (NMF) is a recently developed technique for finding parts-based, linear representations of non-negative data. There are many methods for NMF, such as multiplicative iterative and alternating nonnegative data least squares algorithms (ANLS). Among these methods, the most effective way is alternating nonnegative data least squares algorithms. In this paper, we propose a two-point step size gradient method to solve subproblems of ANLS. The numerical experiment shows that our algorithm is much more efficient than some existing algorithms.
Nonnegative matrix factorization two-point step size gradient method Nonnegative data
Xiaopeng Zhao Hongwei Liu Tongqi Zhang
Department of Mathematics, Weinan Teachers College, Weinan, China Department of Mathematics, Xidian Department of Mathematics, Xidian University, Xian, China Department of Mathematics, Weinan Teachers College, Weinan, China
国际会议
2011 International Conference on Electronics and Optoelectronics(2011电子学与光电子学国际会议 ICEOE 2011)
大连
英文
1080-1083
2011-07-29(万方平台首次上网日期,不代表论文的发表时间)