SuperLectures.com

NOVEL HIERARCHICAL ALS ALGORITHM FOR NONNEGATIVE TENSOR FACTORIZATION

Full Paper at IEEE Xplore

Non-negative Tensor Factorization and Blind Separation

Presented by: Anh-Huy Phan, Author(s): Anh-Huy Phan, Andrzej Cichocki, Brain Science Institue, Japan; Kiyotoshi Matsuoka, Kyushu University of Technology, Japan; Jianting Cao, Brain Science Institue, Japan

The multiplicative algorithms are well-known for nonnegative matrix and tensor factorizations. The ALS algorithm for canonical decomposition (CP) has been proved as a ``work-horse'' algorithm for general multiway data. Unfortunately, for CP with nonnegativity constraints, this algorithm with a rectifier (projection) may not converge to the desired solution without additional regularization parameters in matrix inverses. The hierarchical ALS algorithm improves the performance of the ALS algorithm, outperforms the multiplicative algorithm. However, NTF algorithms can face problem with collinear or bias data. In this paper, we propose a novel algorithm which overwhelmingly outperforms all the multiplicative, and (H)ALS algorithms. By solving the nonnegative quadratic programming problems, a general algorithm of the HALS has been derived and experimentally confirmed its validity and high performance for normal and difficult benchmarks, and for real-world EEG dataset.


  Speech Transcript

|

  Slides

Enlarge the slide | Show all slides in a pop-up window

0:00:16

  1. slide

0:00:50

  2. slide

0:01:44

  3. slide

0:02:41

  4. slide

0:06:43

  5. slide

0:08:23

  6. slide

0:10:13

  7. slide

0:12:11

  8. slide

0:14:11

  9. slide

0:17:08

 10. slide

0:18:09

 11. slide

0:18:58

 12. slide

0:19:25

 13. slide

  Comments

Please sign in to post your comment!

  Lecture Information

Recorded: 2011-05-26 16:55 - 17:15, Club B
Added: 18. 6. 2011 03:09
Number of views: 45
Video resolution: 1024x576 px, 512x288 px
Video length: 0:20:43
Audio track: MP3 [7.01 MB], 0:20:43