Changes between Version 7 and Version 8 of MatrixFactorization
 Timestamp:
 07/11/11 10:40:45 (3 years ago)
Legend:
 Unmodified
 Added
 Removed
 Modified

MatrixFactorization
v7 v8 14 14 15 15 === snmf === 16 Sparse NMF based on alternating nonnegativity constrained least squares, solved by a fast nonnegativity constrained least squares. Sparseness imposed on the left, right factor. [[BR]]16 Sparse NMF based on alternating nonnegativity constrained least squares, solved by a fast nonnegativity constrained least squares. Sparseness imposed on the left, right factor. It is meant to be very fast compared to other approaches. [[BR]] 17 17 Reference: (Kim, 2007). 18 18 … … 26 26 27 27 === lsnmf === 28 Alternating Least Square NMF. It is meant to be very fast compared to other approaches.[[BR]]29 Reference: ( Kim, 2007).28 NMF by alternative nonnegative least squares using projected gradients. [[BR]] 29 Reference: (Lin, 2007). 30 30 31 31 === pmf === … … 110 110 == References == 111 111 * Brunet, J. P., Tamayo, P., Golub, T. R., Mesirov, J. P. Metagenes and molecular pattern discovery using matrix factorization. Proc Natl Acad Sci USA, 2004, 101(12), 41644169. 112 * Lin, C.J. (2007). Projected gradient methods for nonnegative matrix factorization. Neural computation, 19(10), 275679. doi: 10.1162/neco.2007.19.10.2756. 112 113 * Kim, H., Park, H. Sparse nonnegative matrix factorizations via alternating nonnegativityconstrained least squares for microarray data analysis. Bioinformatics (Oxford, England), 2007, 23(12), 1495502. 113 114 * PascualMontano, A., Carazo, J. M., Kochi, K., Lehmann, D., PascualMarqui, R. D. Nonsmooth nonnegative matrix factorization (nsnmf). IEEE transactions on pattern analysis and machine intelligence, 2006 28(3), 403415.