Adaptive PARAFAC decomposition for third-order tensor completion
This paper proposed a tensor completion algorithm by tracking the Parallel Factor (PARAFAC) decomposition of incomplete third-order tensors with one dimension growing with time. The proposed algorithm first tracks a low-dimensional subspace, then updates the loading matrices of the PARAFAC decomposition. Simulation results showed that the algorithm is reliable and fast, in comparison to the state-of-the-art PARAFAC Weighted OPTimization algorithm.