• DocumentCode
    1017843
  • Title

    Nonnegative Matrix and Tensor Factorization [Lecture Notes]

  • Author

    Cichocki, Andrzej ; Zdunek, Rafal ; Amari, Shun-Ichi

  • Volume
    25
  • Issue
    1
  • fYear
    2008
  • fDate
    6/30/1905 12:00:00 AM
  • Firstpage
    142
  • Lastpage
    145
  • Abstract
    In these lecture notes, the authors have outlined several approaches to solve a NMF/NTF problem. The following main conclusions can be drawn: 1) Multiplicative algorithms are not necessary the best approaches for NMF, especially if data representations are not very redundant or sparse. 2) Much better performance can be achieved using the FP-ALS (especially for large-scale problems), IPC, and QN methods. 3) To achieve high performance it is quite important to use the multilayer structure with multistart initialization conditions. 4) To estimate physically meaningful nonnegative components it is often necessary to use some a priori knowledge and impose additional constraints or regularization terms (to control sparsity, boundness, continuity or smoothness of the estimated nonnegative components).
  • Keywords
    matrix decomposition; signal processing; tensors; FP-ALS; IPC methods; QN methods; large-scale problems; multilayer structure; multistart initialization conditions; nonnegative components; nonnegative matrix factorization; nonnegative tensor factorization; Brain modeling; Clustering algorithms; Cost function; Data analysis; Image segmentation; Matrix decomposition; Pattern recognition; Robustness; Surges; Tensile stress;
  • fLanguage
    English
  • Journal_Title
    Signal Processing Magazine, IEEE
  • Publisher
    ieee
  • ISSN
    1053-5888
  • Type

    jour

  • DOI
    10.1109/MSP.2008.4408452
  • Filename
    4408452