首页> 外文会议>International conference of the Italian Association for Artificial Intelligence >Novelty-Aware Matrix Factorization Based on Items' Popularity
【24h】

Novelty-Aware Matrix Factorization Based on Items' Popularity

机译:基于项目流行度的新颖性矩阵分解

获取原文

摘要

The search for unfamiliar experiences and novelty is one of the main drivers behind all human activities, equally important with harm avoidance and reward dependence. A recommender system personalizes suggestions to individuals to help them in their exploration tasks. In the ideal case, these recommendations, except of being accurate, should be also novel. However, up to now most platforms fail to provide both novel and accurate recommendations. For example, a well-known recommendation algorithm, such as matrix factorization (MF), tries to optimize only the accuracy criterion, while disregards the novelty of recommended items. In this paper, we propose a new model, denoted as popularity-based NMF, that allows to trade-off the MF performance with respect to the criteria of novelty, while only minimally compromising on accuracy. Our experimental results demonstrate that we attain high accuracy by recommending also novel items.
机译:寻找陌生的经历和新颖性是所有人类活动背后的主要动力之一,对于避免伤害和奖励依赖同样重要。推荐系统可个性化建议给个人,以帮助他们完成探索任务。在理想情况下,这些建议除了准确无误外,还应该是新颖的。但是,到目前为止,大多数平台都无法同时提供新颖和准确的建议。例如,众所周知的推荐算法,例如矩阵分解(MF),试图仅优化准确性标准,而忽略了推荐项目的新颖性。在本文中,我们提出了一种新模型,称为基于流行度的NMF,该模型允许在新颖性标准方面权衡MF性能,而仅以最小的方式牺牲准确性。我们的实验结果表明,通过推荐新颖的产品也可以达到很高的精度。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号