...
首页> 外文期刊>Eurasip Journal on Wireless Communications and Networking >A social trust and preference segmentation-based matrix factorization recommendation algorithm
【24h】

A social trust and preference segmentation-based matrix factorization recommendation algorithm

机译:基于社会信任和偏好分割的矩阵分解推荐算法

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

获取外文期刊封面封底 >>

       

摘要

A recommendation can inspire potential demands of users and make e-commerce platforms more intelligent and is essential for e-commerce enterprises' sustainable development. The traditional social recommendation algorithm ignores the following fact: the preferences of users with trust relationships are not necessarily similar, and the consideration of user preference similarity should be limited to specific areas. To solve these problems mentioned above, we propose a social trust and preference segmentation-based matrix factorization (SPMF) recommendation algorithm. Experimental results based on the Ciao and Epinions datasets show that the accuracy of the SPMF algorithm is significantly superior to that of some state-of-the-art recommendation algorithms. The SPMF algorithm is a better recommendation algorithm based on distinguishing the difference of trust relations and preference domain, which can support commercial activities such as product marketing.
机译:建议可以激发用户的潜在需求,使电子商务平台更聪明,对电子商务企业的可持续发展至关重要。 传统的社会推荐算法忽略了以下事实:具有信任关系的用户的偏好不一定类似,并且对用户偏好相似度的考虑应该限于特定区域。 为了解决上述这些问题,我们提出了一种社会信任和偏好分割基矩阵分解(SPMF)推荐算法。 基于CIAO和渗透数据集的实验结果表明,SPMF算法的准确性显着优于某些最先进的推荐算法。 SPMF算法是一种基于区分信任关系和偏好域的差异的更好推荐算法,这可以支持产品营销等商业活动。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号