【24h】

A study of Top-N recommendation on user behavior data

机译:对用户行为数据的TOP-N建议书的研究

获取原文

摘要

Traditional collaborative filtering algorithms are designed mostly for making rating predictions. Due to actual applications prefer directly item recommendation rather than the item rating and most of the existing systems do not have user explicit ratings on items, in this paper we focus on the implicit feedback on which filtering approach is constructed to provide users with Top-N recommendation. For the special nature of implicit feedback, a binary matrix is used to represent user-item information. On this basis, we analyze the effectiveness of the various existing typical binary similarity methods applied on the traditional collaborative filtering algorithm. Besides, as the current neighbor selection does not take into account the combined effects of neighbors, this paper adopts a new way that considers the neighbor similarity to avoid selecting too similar neighbors. The experiments conducte on the real dataset show that the traditional recommendation performance can be effectively improved by our methods.
机译:传统的协作过滤算法主要用于提供评级预测。由于实际应用程序更倾向于直接项目推荐而不是物品评级,并且大多数现有系统都没有用户在项目上的明确评级,本文专注于构建过滤方法的隐含反馈,为用户提供顶部n的隐含反馈推荐。对于隐式反馈的特殊性,二进制矩阵用于表示用户项信息。在此基础上,我们分析了在传统的协同滤波算法上应用了各种现有的典型二元相似方法的有效性。此外,由于当前邻居选择不考虑邻居的组合效果,因此本文采用了一种以一种避免选择太平的邻居来实现邻居相似性的新方法。实验在真实数据集上进行的实验表明,我们的方法可以有效地改善了传统的推荐性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号