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: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
ĐHCN
2016
|
Subjects: | |
Online Access: | http://repository.vnu.edu.vn/handle/VNU_123/13033 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Vietnam National University, Hanoi |
Language: | English |