Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
