Background reconstruction via low rank tensor factorization

Author(s):  
shen guiping ◽  
han zhi ◽  
chen xiai ◽  
tang yandong ◽  
zhang yang
2020 ◽  
Vol 68 ◽  
pp. 2170-2185 ◽  
Author(s):  
Xiao Fu ◽  
Shahana Ibrahim ◽  
Hoi-To Wai ◽  
Cheng Gao ◽  
Kejun Huang

Symmetry ◽  
2020 ◽  
Vol 12 (3) ◽  
pp. 439
Author(s):  
Pei Ma ◽  
Liejun Wang ◽  
Jiwei Qin

Low-rank tensor factorization can not only mine the implicit relationships between data but also fill in the missing data when working with complex data. Compared with the traditional collaborative filtering (CF) algorithm, the changes are essentially proposed, from traditional matrix analysis to three-dimensional spatial analysis. Based on low-rank tensor factorization, this paper proposes a recommendation model that comprehensively considers local information and global information, in other words, combining the similarity between trust users and low-rank tensor factorization. First, the similarity between trusted users is measured to capture local information between users by trusting similar preferences of users when selecting items. Then, the users’ similarity is integrated into the tensor, and the low-rank tensor factorization is used to better maintain and describe the internal structure of the data to obtain global information. Furthermore, based on the idea of the alternating least squares method, the conjugate gradient (CG) optimization algorithm for the model of this paper is designed. The local and global information is used to generate the optimal expected result in an iterative process. Finally, we conducted a large number of comparative experiments on the Ciao dataset and the FilmTrust dataset. Experimental results show that the algorithm has less precision loss under the data set with lower density. Thus, not only can a perfect compromise between accuracy and coverage be achieved, but also the computational complexity can be reduced to meet the need for real-time results.


Sign in / Sign up

Export Citation Format

Share Document