Registered Data

[00527] A fast Multiplicative Update algorithm for non-negative matrix factorization

  • Session Time & Room : 3C (Aug.23, 13:20-15:00) @E605
  • Type : Contributed Talk
  • Abstract : This work proposes an efficient algorithm called fastMU (Multiplicative Updates) to deal with a Non-Negative Matrix Factorization problem, based on majorization minimization principle. We derive theoretical convergence results and show the effectiveness of our method through comparison with state-of-the-art methods on both synthetic and realistic data. Practical results show that fastMU is often several orders of magnitude faster than the regular MU proposed by Lee and Sung, and can even be competitive with state-of-the-art methods.
  • Classification : 65Kxx, 90Cxx
  • Format : Talk at Waseda University
  • Author(s) :
    • Mai-Quyen PHAM (IMT Atlantique)
    • Jeremy Cohen (CREATIS, CNRS)
    • Thierry Chonavel (IMT Atlantique)