@inproceedings{SisLab1766,
       booktitle = {2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)},
           month = {March},
           title = {Fast adaptive PARAFAC decomposition algorithm with linear complexity},
          author = {Viet Dung Nguyen and Karim Abed-Meraim and Linh Trung Nguyen},
            year = {2016},
           pages = {6235--6239},
             url = {https://eprints.uet.vnu.edu.vn/eprints/id/eprint/1766/},
        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.}
}