【24h】

User Response Based Recommendations

机译:基于用户响应的建议

获取原文

摘要

In a recommendation system, users provide description of their interests through initial search keywords and the system recommends items based on these keywords. A user is satisfied if it finds the item of its choice and the system benefits, otherwise the user explores an item from the recommended list. Usually when the user explores an item, it picks an item that is nearest to its interest from the list. While the user explores an item, the system recommends new set of items. This continues till either the user finds the item of its interest or quits. In all, the user provides ample chances and feedback for the system to learn its interest. The aim of this paper is to efficiently utilize user responses to recommend items and find the item of user's interest quickly. We first derive optimal policies in the continuous Euclidean space and adapt the same to the space of discrete items. We propose the notion of local angle in the space of discrete items and develop user response-local angle (UR-LA) based recommendation policies. We compare the performance of UR-LA with widely used collaborative filtering (CF) based policies on two real datasets and show that UR-LA performs better in majority of the test cases. We propose a hybrid scheme that combines the best features of both UR-LA and CF (and history) based policies, which outperforms them in most of the cases. Towards the end, we propose alternate recommendation policies again utilizing the user responses, based on clustering techniques. These policies outperform the previous ones, and are computationally less intensive. Further, the clustering based policies perform close to theoretical limits.
机译:在推荐系统中,用户通过初始搜索关键字提供他们的兴趣的描述,并且系统建议基于这些关键字的项目。如果找到其选择的项目和系统优势,则满足用户,否则用户将从推荐列表中探索项目。通常,当用户探索项目时,它会选择最接近其兴趣的项目。当用户探索一个项目时,系统建议新的项目集。这将继续直到用户找到其兴趣或退出的项目。总而言之,用户为系统提供充分的机会和反馈,以了解其兴趣。本文的目的是有效地利用用户响应来推荐项目并快速找到用户的兴趣项目。我们首先在连续欧几里德空间中获得最佳政策,并适应与离散物品的空间相同。我们提出了离散项目的空间中局部角度的概念,并开发了基于用户响应 - 局部角度(UR-LA)的推荐策略。我们将UR-LA的性能与广泛使用的协作过滤(CF)基于两个真实数据集的策略进行比较,并显示UR-LA在大多数测试用例中表现更好。我们提出了一种混合方案,它结合了UR-LA和CF(和历史)策略的最佳特征,这在大多数情况下都优于它们。在结束时,我们根据聚类技术再次提出备用推荐策略,同时使用用户响应。这些策略优于前一个,并且计算不那么密集。此外,基于聚类的策略执行接近理论限制。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号