An accelerated approach for low rank tensor completion
محل انتشار: یازدهمین سمینار جبر خطی و کاربردهای آن
سال انتشار: 1400
نوع سند: مقاله کنفرانسی
زبان: انگلیسی
مشاهده: 145
فایل این مقاله در 6 صفحه با فرمت PDF قابل دریافت می باشد
- صدور گواهی نمایه سازی
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
SLAA11_004
تاریخ نمایه سازی: 16 اسفند 1401
چکیده مقاله:
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 thetensor, 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 thecomputational 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 itscomputational complexity decreases in each iteration.
کلیدواژه ها:
نویسندگان
Faezeh Aghamohammadi
Department of Applied Mathematics, Faculty of Mathematics and Computer Sciences,Amirkabir University of Technology (Tehran Polytechnic), Tehran, Iran
Fatemeh Shakeri
Department of Applied Mathematics, Faculty of Mathematics and Computer Sciences,Amirkabir University of Technology (Tehran Polytechnic), Tehran, Iran