Personalized Recommendation Based on Contextual Awareness and Tensor Decomposition

Personalized Recommendation Based on Contextual Awareness and Tensor Decomposition

Zhenjiao Liu (School of Information Science and Engineering, Qilu Normal University, Ji'nan, China), Xinhua Wang (School of Information Science and Engineering, Shandong Normal University, Ji'nan, China), Tianlai Li (Office of information technology, Shandong Normal University, Ji'nan, China) and Lei Guo (School of Management Science and Engineering, Shandong Normal University, Ji'nan, China)
Copyright: © 2018 |Pages: 13
DOI: 10.4018/JECO.2018070104
OnDemand PDF Download:
No Current Special Offers


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.
Article Preview


With the significant improvement of Internet technology, the phenomenon of “information overload” has appeared in the Internet. Users have difficulties in quickly finding the required information among the vast amount of information. Thus, to solve the problem of “information overload” has become one of the popular research fields. Although information retrieval technology has suspended this phenomenon, it still cannot meet the service demand from the users. Using recommender system which is able to recommend service information in which users are interested according to individuals’ behavior sand preferences among a large amount of data is an effective means to solve the problem of information overload. In the research of the current recommender system, to meet the needs of the user personalized recommender system has become a popular researching direction. Traditional recommender system usually makes related calculation according to the (User-Item) two-dimensional relation, and recommends users the most relevant resources via the calculation results. Since the traditional recommendation systems don’t take the differences brought by individual preference in consideration, the technical scheme in practical applications is not comprehensive. In this case, the contextual awareness technology appears to be a new direction of research of scholars. Traditional contextual awareness recommendation algorithm combines the contextual information and establish the recommendation model based on the binary relations of “user-resources”, and then the influence of contextual information of users’ preferences will be calculated. Then it will make prediction of the users’ behaviors. JIN et al. (2012) used label information technology to solve the user interest preferences. Basing on this condition, they built a trust network, and use the random walk algorithm for top-N recommendation. But during the application process of this algorithm, it appeared the problems of the cold start and the complexity of time. Guo lei et al. (2013) discuss the asocial recommendation algorithm which had a sensitive extend of trust relationship. The degree of closeness of social networks were applied in the predicted score calculation process. It effectively improved the accuracy of recommendation. LI et al. (2015) showed in their previous work that proposed a trust network matrix decomposition algorithm based on contextual awareness, which is based on the combination of trust relations and matrix decomposition algorithm. And this method was effective in solving the problems of data sparseness degree. The SVD++ Time algorithm proposed by KOREN et al. (2012) showed an effective method to add the time contextual information to the user (s) feature vector, which can effectively solve the problem of the time variation of interest. Xiong et al. (2010) took the time contextual information as the third dimension of the third order tensor, using higher order singular value decomposition technique to modeled the dynamic change of recommend process, and produced the related recommendation list to improve the quality of recommendation. Li et al. (2011) proposed a cross domain collaborative filtering algorithm based on the differences of users' interest in different time periods. The algorithm can effectively recommend the change of user’s interest by means of tracking. Zhen et al. (2015) establishment of social tagging and temporal interest evolution model to improve the recommendation effect of micro-blog recommendation algorithm. Bin et al. (2016) They proposed collaborative filtering algorithm based on interest transfer model has a good recommendation.

Complete Article List

Search this Journal:
Open Access Articles
Volume 19: 4 Issues (2021): 1 Released, 3 Forthcoming
Volume 18: 4 Issues (2020)
Volume 17: 4 Issues (2019)
Volume 16: 4 Issues (2018)
Volume 15: 4 Issues (2017)
Volume 14: 4 Issues (2016)
Volume 13: 4 Issues (2015)
Volume 12: 4 Issues (2014)
Volume 11: 4 Issues (2013)
Volume 10: 4 Issues (2012)
Volume 9: 4 Issues (2011)
Volume 8: 4 Issues (2010)
Volume 7: 4 Issues (2009)
Volume 6: 4 Issues (2008)
Volume 5: 4 Issues (2007)
Volume 4: 4 Issues (2006)
Volume 3: 4 Issues (2005)
Volume 2: 4 Issues (2004)
Volume 1: 4 Issues (2003)
View Complete Journal Contents Listing