首页> 外文期刊>ACM Transactions on Interactive Intelligent Systems >Learning Context-dependent Personal Preferences for Adaptive Recommendation
【24h】

Learning Context-dependent Personal Preferences for Adaptive Recommendation

机译:学习适应性建议的上下文相关的个人喜好

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

摘要

We propose two online-learning algorithms for modeling the personal preferences of users of interactive systems. The proposed algorithms leverage user feedback to estimate user behavior and provide personalized adaptive recommendation for supporting context-dependent decision-making. We formulate preference modeling as online prediction algorithms over a set of learned policies, i.e., policies generated via supervised learning with interaction and context data collected from previous users. The algorithms then adapt to a target user by learning the policy that best predicts that user's behavior and preferences. We also generalize the proposed algorithms for a more challenging learning case in which they are restricted to a limited number of trained policies at each timestep, i.e., for mobile settings with limited resources. While the proposed algorithms are kept general for use in a variety of domains, we developed an image-filter-selection application. We used this application to demonstrate how the proposed algorithms can quickly learn to match the current user's selections. Based on these evaluations, we show that (1) the proposed algorithms exhibit better prediction accuracy compared to traditional supervised learning and bandit algorithms, (2) our algorithms are robust under challenging limited prediction settings in which a smaller number of expert policies is assumed. Finally, we conducted a user study to demonstrate how presenting users with the prediction results of our algorithms significantly improves the efficiency of the overall interaction experience.
机译:我们提出了两个在线学习算法,用于建立交互式系统用户的个人喜好。所提出的算法利用用户反馈来估计用户行为,并提供个性化的自适应推荐,以支持上下文依赖的决策。我们在一组学习的策略中作为在线预测算法,即通过监督学习的策略与从以前的用户收集的互动和上下文数据产生的策略制定偏好建模。然后,算法通过学习最能预测用户的行为和偏好的策略来适应目标用户。我们还概括了提出的算法,以获得更具挑战性的学习案例,其中它们仅限于每个时间步骤中的有限数量的训练策略,即,对于具有有限资源的移动设置。虽然所提出的算法保持一般用于各种域,但我们开发了一种图像过滤器选择应用。我们使用此应用程序来演示所提出的算法如何快速学习匹配当前用户的选择。基于这些评估,我们表明(1)与传统的监督学习和强盗算法相比,所提出的算法表现出更好的预测准确性,(2)我们的算法在挑战有限预测设置下是强大的,其中假设较少数量的专家策略。最后,我们进行了一个用户学习,以展示具有我们算法预测结果的用户的呈现方式显着提高了整体交互体验的效率。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号