Rxivist logo

Fast Nonnegative Matrix Factorization and Applications to Pattern Extraction, Deconvolution and Imputation

By Xihui Lin, Paul C. Boutros

Posted 15 May 2018
bioRxiv DOI: 10.1101/321802

Nonnegative matrix factorization (NMF) is a technique widely used in various fields, including artificial intelligence (AI), signal processing and bioinformatics. However existing algorithms and R packages cannot be applied to large matrices due to their slow convergence, and cannot handle missing values. In addition, most NMF research focuses only on blind decompositions: decomposition without utilizing prior knowledge. We adapt the idea of sequential coordinate-wise descent to NMF to increase the convergence rate. Our NMF algorithm thus handles missing values naturally and integrates prior knowledge to guide NMF towards a more meaningful decomposition. To support its use, we describe a novel imputation-based method to determine the rank of decomposition. All our algorithms are implemented in the R package NNLM, which is freely available on CRAN.

Download data

  • Downloaded 740 times
  • Download rankings, all-time:
    • Site-wide: 14,783 out of 76,820
    • In bioinformatics: 2,345 out of 7,425
  • Year to date:
    • Site-wide: 19,405 out of 76,820
  • Since beginning of last month:
    • Site-wide: 18,261 out of 76,820

Altmetric data

Downloads over time

Distribution of downloads per paper, site-wide


Sign up for the Rxivist weekly newsletter! (Click here for more details.)