Nonnegative matrix factorization algorithms based on the inertial projection neural network

2018 ◽  
Vol 31 (8) ◽  
pp. 4215-4229 ◽  
Author(s):  
Xiangguang Dai ◽  
Chuandong Li ◽  
Xing He ◽  
Chaojie Li
Keyword(s):  
Neural Network ◽  
Matrix Factorization ◽  
Nonnegative Matrix Factorization ◽  
Nonnegative Matrix ◽  
Factorization Algorithms ◽  
Projection Neural Network

scholarly journals A neural network for determination of latent dimensionality in Nonnegative Matrix Factorization

2020 ◽  
Author(s):  
Benjamin Nebgen ◽  
Raviteja Vangara ◽  
Miguel A. Hombrados-Herrera ◽  
Svetlana Kuksova ◽  
Boian Alexandrov
Keyword(s):  
Neural Network ◽  
Matrix Factorization ◽  
Nonnegative Matrix Factorization ◽  
Nonnegative Matrix

scholarly journals Matrix Factorization Algorithms for the Identification of Muscle Synergies: Evaluation on Simulated and Experimental Data Sets

2006 ◽  
Vol 95 (4) ◽  
pp. 2199-2212 ◽  
Author(s):  
Matthew C. Tresch ◽  
Vincent C. K. Cheung ◽  
Andrea d'Avella
Keyword(s):  
Matrix Factorization ◽  
Muscle Activation ◽  
Nonnegative Matrix Factorization ◽  
Nonnegative Matrix ◽  
Muscle Synergies ◽  
Data Sets ◽  
Data Set ◽  
Activation Patterns ◽  
Muscle Activation Patterns ◽  
Factorization Algorithms

Several recent studies have used matrix factorization algorithms to assess the hypothesis that behaviors might be produced through the combination of a small number of muscle synergies. Although generally agreeing in their basic conclusions, these studies have used a range of different algorithms, making their interpretation and integration difficult. We therefore compared the performance of these different algorithms on both simulated and experimental data sets. We focused on the ability of these algorithms to identify the set of synergies underlying a data set. All data sets consisted of nonnegative values, reflecting the nonnegative data of muscle activation patterns. We found that the performance of principal component analysis (PCA) was generally lower than that of the other algorithms in identifying muscle synergies. Factor analysis (FA) with varimax rotation was better than PCA, and was generally at the same levels as independent component analysis (ICA) and nonnegative matrix factorization (NMF). ICA performed very well on data sets corrupted by constant variance Gaussian noise, but was impaired on data sets with signal-dependent noise and when synergy activation coefficients were correlated. Nonnegative matrix factorization (NMF) performed similarly to ICA and FA on data sets with signal-dependent noise and was generally robust across data sets. The best algorithms were ICA applied to the subspace defined by PCA (ICAPCA) and a version of probabilistic ICA with nonnegativity constraints (pICA). We also evaluated some commonly used criteria to identify the number of synergies underlying a data set, finding that only likelihood ratios based on factor analysis identified the correct number of synergies for data sets with signal-dependent noise in some cases. We then proposed an ad hoc procedure, finding that it was able to identify the correct number in a larger number of cases. Finally, we applied these methods to an experimentally obtained data set. The best performing algorithms (FA, ICA, NMF, ICAPCA, pICA) identified synergies very similar to one another. Based on these results, we discuss guidelines for using factorization algorithms to analyze muscle activation patterns. More generally, the ability of several algorithms to identify the correct muscle synergies and activation coefficients in simulated data, combined with their consistency when applied to physiological data sets, suggests that the muscle synergies found by a particular algorithm are not an artifact of that algorithm, but reflect basic aspects of the organization of muscle activation patterns underlying behaviors.

scholarly journals Recurrent neural network for approximate nonnegative matrix factorization

2014 ◽  
Vol 138 ◽  
pp. 238-247 ◽  
Author(s):  
Giovanni Costantini ◽  
Renzo Perfetti ◽  
Massimiliano Todisco
Keyword(s):  
Neural Network ◽  
Recurrent Neural Network ◽  
Matrix Factorization ◽  
Nonnegative Matrix Factorization ◽  
Nonnegative Matrix

scholarly journals Accelerating Nonnegative Matrix Factorization Algorithms Using Extrapolation

2019 ◽  
Vol 31 (2) ◽  
pp. 417-439 ◽  
Author(s):  
Andersen Man Shun Ang ◽  
Nicolas Gillis
Keyword(s):  
Least Squares ◽  
Matrix Factorization ◽  
Nonnegative Matrix Factorization ◽  
State Of The Art ◽  
Gradient Methods ◽  
Nonnegative Matrix ◽  
Synthetic Image ◽  
Data Sets ◽  
Extrapolation Scheme ◽  
Factorization Algorithms

We propose a general framework to accelerate significantly the algorithms for nonnegative matrix factorization (NMF). This framework is inspired from the extrapolation scheme used to accelerate gradient methods in convex optimization and from the method of parallel tangents. However, the use of extrapolation in the context of the exact coordinate descent algorithms tackling the nonconvex NMF problems is novel. We illustrate the performance of this approach on two state-of-the-art NMF algorithms: accelerated hierarchical alternating least squares and alternating nonnegative least squares, using synthetic, image, and document data sets.

Sign in / Sign up

Export Citation Format

Share Document