
Fast adaptive PARAFAC decomposition algorithm with linear complexity / Nguyen, Linh Trung
Tác giả : Nguyen, Linh Trung
Nhà xuất bản : ĐHCN
Năm xuất bản : 2016
Chủ đề : 1. Linear complexity. 2. PARAFAC. 3. Article.
Thông tin chi tiết
Tóm tắt : | 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. |
Thông tin dữ liệu nguồn
Thư viện | Ký hiệu xếp giá | Dữ liệu nguồn |
---|---|---|
![]() |
|
https://repository.vnu.edu.vn/handle/VNU_123/13033 |