On nonnegative matrix factorization algorithms for signal-dependent noise with application to electromyography data

Karthik Devarajan, Vincent C.K. Cheung

Research output: Contribution to journalLetterpeer-review

42 Scopus citations

Abstract

Nonnegative matrix factorization (NMF) by the multiplicative updates algorithm is a powerful machine learning method for decomposing a high-dimensional nonnegative matrix V into two nonnegative matrices, Wand H, where V ~WH. It has been successfully applied in the analysis and interpretation of large-scale data arising in neuroscience, computational biology, and natural language processing, among other areas. A distinctive feature of NMFis its nonnegativity constraints that allow only additive linear combinations of the data, thus enabling it to learn parts that have distinct physical representations in reality. In this letter, we describe an information-theoretic approach to NMF for signal-dependent noise based on the generalized inverse gaussian model. Specifically, we propose three novel algorithms in this setting, each based on multiplicative updates, and prove monotonicity of updates using the EM algorithm. In addition, we develop algorithm-specific measures to evaluate their goodness of fit on data. Our methods are demonstrated using experimental data from electromyography studies, as well as simulated data in the extraction of muscle synergies, and compared with existing algorithms for signal-dependent noise.

Original languageEnglish
Pages (from-to)1128-1168
Number of pages41
JournalNeural Computation
Volume26
Issue number6
DOIs
StatePublished - 2014

Keywords

  • Algorithms
  • Animals
  • Artificial Intelligence
  • Computational Biology
  • Electromyography
  • Humans
  • Muscle, Skeletal/physiology
  • Normal Distribution
  • Pattern Recognition, Automated

Fingerprint

Dive into the research topics of 'On nonnegative matrix factorization algorithms for signal-dependent noise with application to electromyography data'. Together they form a unique fingerprint.

Cite this