Algorithms, Initializations, and Convergence for the Nonnegative Matrix Factorization
From MaRDI portal
Publication:6511571
arXiv1407.7299MaRDI QIDQ6511571FDOQ6511571
Authors: Amy N. Langville, Carl D. Meyer, Russell Albright, James C. Cox, David Duling 
Abstract: It is well known that good initializations can improve the speed and accuracy of the solutions of many nonnegative matrix factorization (NMF) algorithms. Many NMF algorithms are sensitive with respect to the initialization of W or H or both. This is especially true of algorithms of the alternating least squares (ALS) type, including the two new ALS algorithms that we present in this paper. We compare the results of six initialization procedures (two standard and four new) on our ALS algorithms. Lastly, we discuss the practical issue of choosing an appropriate convergence criterion.
This page was built for publication: Algorithms, Initializations, and Convergence for the Nonnegative Matrix Factorization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6511571)
