...
首页> 外文期刊>Knowledge-Based Systems >Exploiting matrix factorization to asymmetric user similarities in recommendation systems
【24h】

Exploiting matrix factorization to asymmetric user similarities in recommendation systems

机译:在推荐系统中利用矩阵分解处理非对称用户相似性

获取原文
获取原文并翻译 | 示例

摘要

Although collaborative filtering is widely applied in recommendation systems, it still suffers from several major limitations, including data sparsity and scalability. Sparse data affects the quality of the user similarity measurement and consequently the quality of the recommender system. In this paper, we propose a novel user similarity measure aimed at providing a valid similarity measurement between users with very few ratings. The contributions of this paper are twofold: First, we suggest an asymmetric user similarity method to distinguish between the impact that the user has on his neighbor and the impact that the user receives from his neighbor. Second, we apply matrix factorization to the user similarity matrix in order to discover the similarities between users who have rated different items. Experimental results show that our method performs better than commonly used approaches, especially under cold-start condition. (C) 2015 Elsevier B.V. All rights reserved.
机译:尽管协作过滤在推荐系统中得到了广泛应用,但是它仍然受到几个主要限制,包括数据稀疏性和可伸缩性。稀疏数据会影响用户相似性度量的质量,从而影响推荐系统的质量。在本文中,我们提出了一种新颖的用户相似性度量,旨在提供评分很少的用户之间的有效相似性度量。本文的贡献有两个方面:首先,我们建议一种非对称的用户相似性方法,以区分用户对其邻居的影响和用户从邻居那里受到的影响。其次,我们将矩阵分解应用于用户相似度矩阵,以便发现对不同项目进行评分的用户之间的相似度。实验结果表明,该方法的性能优于常用方法,尤其是在冷启动条件下。 (C)2015 Elsevier B.V.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号