An Improved Tensor Decomposition Model for Recommendation System

Author(s):  
Wenqian Shang
Author(s):  
Yuto Yamaguchi ◽  
Kohei Hayashi

How can we decompose a data tensor if the indices are partially missing?Tensor decomposition is a fundamental tool to analyze the tensor data.Suppose, for example, we have a 3rd-order tensor X where each element Xijk takes 1 if user i posts word j at location k on Twitter.Standard tensor decomposition expects all the indices are observed but, in some tweets, location k can be missing.In this paper, we study a tensor decomposition problem where the indices (i, j, or k) of some observed elements are partially missing.Towards the problem, we propose a probabilistic tensor decomposition model that handles missing indices as latent variables.To infer them, we derive an algorithm based on stochastic variational inference, which enables to leverage the information from the incomplete data scalably. The experiments on both synthetic and real datasets show that the proposed method achieves higher accuracy in the tensor completion task than baselines that cannot handle missing indices.


This paper refers to study of industrial robot (KUKA KR16-2), in which we have considered the matrix decomposition and tensor decomposition model in rotational motion. We have considered robotic matrix & Tensor and defined a modal product between robot rotation matrix and a tensor Further we have proposed the third order tensor for the motion of Industrial robot and tried to find out the useful result. At last we have shown that the tensor model is providing alternate way to find the solution.


Author(s):  
Athanasios A. Rontogiannis ◽  
Eleftherios Kofidis ◽  
Paris Giampouras

2018 ◽  
Vol 16 (3) ◽  
pp. 39-51
Author(s):  
Zhenjiao Liu ◽  
Xinhua Wang ◽  
Tianlai Li ◽  
Lei Guo

In order to solve users' rating sparsely problem existing in present recommender systems, this article proposes a personalized recommendation algorithm based on contextual awareness and tensor decomposition. Via this algorithm, it was first constructed two third-order tensors to represent six types of entities, including the user-user-item contexts and the item-item-user contexts. And then, this article uses a high order singular value decomposition method to mine the potential semantic association of the two third-order tensors above. Finally, the resulting tensors were combined to reach the recommendation list to respond the users' personalized query requests. Experimental results show that the proposed algorithm can effectively improve the effectiveness of the recommendation system. Especially in the case of sparse data, it can significantly improve the quality of the recommendation.


Sign in / Sign up

Export Citation Format

Share Document