عنوان مقاله:

نویسندگان:

فائزه آقامحمدی، فاطمه شاکری

Tensor completion problem, which is a generalization of the matrix completion problem, is recovering the missing data of a tensor. In many algorithms proposed to complete the tensor, to achieve the answer, the method is executed on all unfolds related to tensor modes. Hence, if a tensor has N modes, each iteration of the algorithm contains N sub-problems, which is equivalent to solving N matrix completion problems. In this paper, to overcome the computational complexity caused by applying the algorithm to each dimension of the tensor, we present an idea in which the problem is implemented on only one tensor unfolding, so its computational complexity decreases in each iteration.

Tensor completion problem, n-rank, computational complexity

برای لینک‌دهی به این مقاله از آدرس زیر استفاده نمایید:

برای ارجاع در منابع از عبارت زیر استفاده کنید:
آقامحمدی، فائزه، شاکری، فاطمه، 1400، An accelerated approach for low rank tensor completion، یازدهمین سمینار جبر خطی و کاربردهای آن، https://cnf.hsu.ac.ir/fa/archive_index.php?c=esla&aid=70560