eprintid: 2192
rev_number: 10
eprint_status: archive
userid: 17
dir: disk0/00/00/21/92
datestamp: 2016-12-25 16:57:09
lastmod: 2016-12-25 16:57:09
status_changed: 2016-12-25 16:57:09
type: conference_item
metadata_visibility: show
creators_name: Nguyen, Viet Dung
creators_name: Abed-Meraim, Karim
creators_name: Nguyen, Linh Trung
creators_id: nvdung1987@gmail.com
creators_id: karim.abed-meraim@univ-orleans.fr
creators_id: linhtrung@vnu.edu.vn
title: Fast adaptive PARAFAC decomposition algorithm with linear complexity
ispublished: pub
subjects: ECE
divisions: fac_fet
abstract: 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
date_type: published
official_url: http://dx.doi.org/10.1109/ICASSP.2016.7472876
full_text_status: restricted
pres_type: poster
place_of_pub: Shanghai, China
pagerange: 6235-6239
event_title: 41th IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP)
event_location: Shanghai, China
event_dates: 20-25 March
event_type: conference
refereed: TRUE
citation:   Nguyen, Viet Dung and Abed-Meraim, Karim and Nguyen, Linh Trung  (2016) Fast adaptive PARAFAC decomposition algorithm with linear complexity.  In: 41th IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP), 20-25 March, Shanghai, China.     
document_url: https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2192/1/07472876.pdf