【24h】

Low-Rank and Sparse Cross-Domain Recommendation Algorithm

机译:低秩和稀疏跨域推荐算法

获取原文

摘要

In this paper, we propose a novel Cross-Domain Collaborative Filtering (CDCF) algorithm termed Low-rank and Sparse Cross-Domain (LSCD) recommendation algorithm. Different from most of the CDCF algorithms which tri-factorize the rating matrix of each domain into three low dimensional matrices, LSCD extracts a user and an item latent feature matrix for each domain respectively. Besides, in order to improve the performance of recommendations among correlated domains by transferring knowledge and uncorrelated domains by differentiating features in different domains, the features of users are separated into shared and domain-specific parts adaptively. Specifically, a low-rank matrix is used to capture the shared feature subspace of users and a sparse matrix is used to characterize the discriminative features in each specific domain. Extensive experiments on two real-world datasets have been conducted to confirm that the proposed algorithm transfers knowledge in a better way to improve the quality of recommendation and outperforms the state-of-the-art recommendation algorithms.
机译:在本文中,我们提出了一种新颖的跨域协作过滤(CDCF)算法,称为低秩和稀疏跨域(LSCD)推荐算法。与大多数将每个域的评级矩阵分解为三个低维矩阵的CDCF算法不同,LSCD分别为每个域提取用户和项目潜在特征矩阵。此外,为了通过区分不同领域中的特征来通过转移知识域和不相关领域来提高相关领域之间推荐的性能,将用户特征自适应地分成共享部分和特定于领域的部分。具体而言,低秩矩阵用于捕获用户的共享特征子空间,而稀疏矩阵用于表征每个特定域中的歧视性特征。已经在两个真实世界的数据集上进行了广泛的实验,以确认所提出的算法以更好的方式来转移知识,从而提高了推荐质量,并且胜过了最新的推荐算法。

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号