Fast adaptive PARAFAC decomposition algorithm with linear complexity
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...
Saved in:
| Main Authors: | , , |
|---|---|
| 格式: | Article |
| 語言: | English |
| 出版: |
ĐHCN
2016
|
| 主題: | |
| 在線閱讀: | http://repository.vnu.edu.vn/handle/VNU_123/13033 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|