Fast adaptive PARAFAC decomposition algorithm with linear complexity

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 grow- ing 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.
Type de document :
Communication dans un congrès
International Conference on Acoustics, Speech and Signal Processing (ICASSP 2016), Mar 2016, Shanghai, China
Liste complète des métadonnées

https://hal.inria.fr/hal-01306461
Contributeur : Viet-Dung Nguyen <>
Soumis le : dimanche 24 avril 2016 - 01:08:09
Dernière modification le : lundi 25 avril 2016 - 01:01:27

Identifiants

  • HAL Id : hal-01306461, version 1

Collections

Citation

Viet-Dung Nguyen, Karim Abed-Meraim, Linh-Trung Nguyen. Fast adaptive PARAFAC decomposition algorithm with linear complexity. International Conference on Acoustics, Speech and Signal Processing (ICASSP 2016), Mar 2016, Shanghai, China. 〈hal-01306461〉

Partager

Métriques

Consultations de la notice

89