Recommender systems(RS), especially collaborative filtering(CF) based RS, has been playing an important role in many e-commerce applications. As the information being searched over the internet is rapidly increasing, users often face the difficulty of finding items of his/her own interest and RS often provides help in such tasks. Recent studies show that, as the item space increases, and the number of items rated by the users become very less, issues like sparsity arise. To mitigate the sparsity problem, transfer learning techniques are being used wherein the data from dense domain(source) is considered in order to predict the missing entries in the sparse domain(target). In this paper, we propose a transfer learning approach for cross-domain recommendation when both domains have no overlap of users and items. In our approach the transferring of knowledge from source to target domain is done in a novel way. We make use of co-clustering technique to obtain the codebook (cluster-level rating pattern) of source domain. By making use of hinge loss function we transfer the learnt codebook of the source domain to target. The use of hinge loss as a loss function is novel and has not been tried before in transfer learning. We demonstrate that our technique improves the approximation of the target matrix on benchmark datasets.
翻译:建议系统(RS),特别是合作过滤系统(CF)以RS为基础,在许多电子商务应用中一直发挥着重要的作用。随着互联网搜索的信息正在迅速增加,用户往往难以找到自己感兴趣的项目,RS经常在这类任务中提供帮助。最近的研究显示,随着项目空间的增加,用户评级项目的数量减少,问题也随之出现。为了缓解紧张问题,正在使用转让学习技术,即考虑密集域(源)的数据,以预测稀疏域(目标)中缺失的条目。在本文中,当两个域没有用户和项目重叠时,我们提出跨域建议的转移学习方法。在我们的方法中,知识从源向目标域的转移是以新的方式完成的。我们利用联合集群技术获得源域的代码簿(集群级评级模式),通过使用关键损失功能,我们将源域(源域(源)所学的代码簿转移到目标。使用断线丢失功能是新颖的,在基准转移前没有尝试过。我们的数据基准矩阵学习了。我们改进了技术。我们改进了基准矩阵。我们学习了技术。