relation: https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1766/
title: Fast adaptive PARAFAC decomposition algorithm with linear complexity
creator: Nguyen, Viet Dung
creator: Abed-Meraim, Karim
creator: Nguyen, Linh Trung
subject: Electronics and Communications
subject: Electronics and Computer Engineering
description: We present a fast adaptive PARAFAC decomposition algorithm with low computational complexity. The proposed algorithm generalizes the Orthonormal Projection Approximation Subspace Tracking (OPAST) approach for tracking a class of third-order tensors which have one dimension growing with time. It has linear complexity, good convergence rate and good estimation accuracy. To deal with large-scale problems, a parallel implementation can be applied to reduce both computational complexity and storage. We illustrate the effectiveness of our algorithm in comparison with the state-of-the-art algorithms through simulation experiments.
date: 2016-03-20
type: Conference or Workshop Item
type: PeerReviewed
format: application/pdf
language: en
identifier: https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1766/1/IEEE%20Xplore%20Abstract%20-%20Fast%20adaptive%20PARAFAC%20decomposition%20algorithm%20with%20linear%20complexity.pdf
identifier:   Nguyen, Viet Dung and Abed-Meraim, Karim and Nguyen, Linh Trung  (2016) Fast adaptive PARAFAC decomposition algorithm with linear complexity.  In: 2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 20-25 March 2016, China.     
relation: http://www.icassp2016.org