Changes between Version 7 and Version 8 of MatrixFactorization


Ignore:
Timestamp:
07/11/11 10:40:45 (3 years ago)
Author:
MarinkaZitnik
Comment:

Legend:

Unmodified
Added
Removed
Modified
  • MatrixFactorization

    v7 v8  
    1414 
    1515=== s-nmf === 
    16 Sparse NMF based on alternating non-negativity constrained least squares, solved by a fast non-negativity constrained least squares. Sparseness imposed on the left, right factor. [[BR]] 
     16Sparse NMF based on alternating non-negativity constrained least squares, solved by a fast non-negativity constrained least squares. Sparseness imposed on the left, right factor. It is meant to be very fast compared to other approaches. [[BR]] 
    1717Reference: (Kim, 2007). 
    1818 
     
    2626 
    2727=== ls-nmf === 
    28 Alternating Least Square NMF. It is meant to be very fast compared to other approaches.[[BR]] 
    29 Reference: (Kim, 2007). 
     28NMF by alternative non-negative least squares using projected gradients. [[BR]] 
     29Reference: (Lin, 2007). 
    3030 
    3131=== pmf === 
     
    110110== References ==  
    111111 * 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), 4164--4169. 
     112 * Lin, C.J. (2007). Projected gradient methods for nonnegative matrix factorization. Neural computation, 19(10), 2756-79. doi: 10.1162/neco.2007.19.10.2756. 
    112113 * Kim, H., Park, H. Sparse non-negative matrix factorizations via alternating non-negativity-constrained least squares for microarray data analysis. Bioinformatics (Oxford, England), 2007, 23(12), 1495--502. 
    113114 * Pascual-Montano, A., Carazo, J. M., Kochi, K., Lehmann, D., Pascual-Marqui, R. D. Nonsmooth nonnegative matrix factorization (nsnmf). IEEE transactions on pattern analysis and machine intelligence, 2006 28(3), 403--415.