Article ID Journal Published Year Pages File Type
488477 Procedia Computer Science 2016 8 Pages PDF
Abstract

Online shopping has become the buzzword in this information age. Users want to purchase the best possible item and services at the shortest span of time. In this information age Recommender system is a very useful tool, because it has the capability of filtering the information according to user interest and provide personalized suggestion. One of the major drawbacks of the classical recommender system is that, they deal with the only single domain. In real world scenario domains could be related to each other by some common information. There are many approaches available for cross domain recommendation, but they are not able to provide better accuracy of high dimensional data and these approaches are suffering from data sparsity problem. In this paper, we deal with cross domain recommendation where we exploit knowledge from auxiliary domains (e.g., movies) which contains additional user preference data to improve recommendation on the target domain (e.g., books). In order to achieve a high level of accuracy, we make use of semantic similarity measure of common information by which domains are related and Tensor decomposition to exploiting the latent factor for high dimensional data. Tensor decomposition with semantic similarity is used for making cross domain recommendation where in the data sparsity problem is avoided by normalizing and clustering the data in auxiliary domain. We provide experimental results on real world data sets and compared our proposed method with other similar approaches based on hit ratio and the results show that we achieve a better hit ratio.

Related Topics
Physical Sciences and Engineering Computer Science Computer Science (General)
Authors
, , ,