Matlab code for Non-negative Matrix Factorization combining random projections and Nesterov iterations

Matthieu PUIGT 06201633b2 Ajouter 'synthetic_data/ReadMe.md' il y a 5 ans
Code ee2c9669a7 Transférer les fichiers vers 'Code/algorithms' il y a 5 ans
output 56f30c1df1 Ajouter 'output/ReadMe.md' il y a 5 ans
synthetic_data 06201633b2 Ajouter 'synthetic_data/ReadMe.md' il y a 5 ans
README.md 93c9a093d7 Mettre à jour 'README.md' il y a 5 ans

README.md

Faster-than-fast NMF using random projections and Nesterov iterations

Random projections have been recently implemented in Nonnegative Matrix Factorization (NMF) to speed-up the NMF computations, with a negligible loss of performance. In this paper, we investigate the effects of such projections when the NMF technique uses the fast Nesterov gradient descent (NeNMF). We experimentally show that structured random projections significantly speed-up NeNMF for very large data matrices.

Purpose

ToWrite

Download

Download the Matlab code of the proposed NeNMF method with random projections The code was written by Farouk YAHAYA (farouk.yahaya [at] univ-littoral.fr) and is maintained by Farouk YAHAYA and Matthieu PUIGT (matthieu.puigt [at] univ-littoral.fr).

It contains several functions and folders:

  • README.m
  • add_paths.m
  • Demo.m
  • data_simuilation.m
  • plots.m
  • stop_rule.m
  • algorithms
    • VANILLA_NeNMF.m
    • RSI_NeNMF.m
  • output
  • synthetic_data

Reference

If you use this code for research or educational purpose, please cite:

F. Yahaya, M. Puigt, G. Delmaire, and G. Roussel, "Faster-than-fast NMF using random projections and Nesterov iterations," in Proc. of iTWIST: international Traveling Workshop on Interactions between low-complexity data models and Sensing Techniques, Marseille, France, November 21-23, 2018.