Sorry, you need to enable JavaScript to visit this website.

Higher-order Nonnegative CANDECOMP/PARAFAC Tensor Decomposition Using Proximal Algorithm

Primary tabs

Citation Author(s):
Deqing Wang, Fengyu Cong, Tapani Ristaniemi
Submitted by:
Deqing Wang
Last updated:
10 May 2019 - 5:09pm
Document Type:
Poster
Document Year:
2019
Event:

Abstract 

Abstract: 

Tensor decomposition is a powerful tool for analyzing multiway data. Nowadays, with the fast development of multisensor technology, more and more data appear in higher-order (order >= 4) and nonnegative form. However, the decomposition of higher-order nonnegative tensor suffers from poor convergence and low speed. In this study, we propose a new nonnegative CANDECOM/PARAFAC (NCP) model using proximal algorithm. The block principal pivoting method in alternating nonnegative least squares (ANLS) framework is employed to minimize the objective function. Our method can guarantee the convergence and accelerate the computation. The results of experiments on both synthetic and real data demonstrate the efficiency and superiority of our method.

up
0 users have voted:

Dataset Files

Wang_et_al_Poster_NCP_ICASSP2019.pdf

(185)