首页> 外文会议>European conference on machine learning and knowledge discovery in databases >Fast ALS-Based Tensor Factorization for Context-Aware Recommendation from Implicit Feedback
【24h】

Fast ALS-Based Tensor Factorization for Context-Aware Recommendation from Implicit Feedback

机译:基于ALS的基于ALS的快速Tensor因式分解从隐式反馈

获取原文

摘要

Albeit the implicit feedback based recommendation problem-when only the user history is available but there are no ratings-is the most typical setting in real-world applications, it is much less researched than the explicit feedback case. State-of-the-art algorithms that are efficient on the explicit case cannot be straightforwardly transformed to the implicit case if scalability should be maintained. There are few implicit feedback benchmark datasets, therefore new ideas are usually experimented on explicit benchmarks. In this paper, we propose a generic context-aware implicit feedback recommender algorithm, coined iTALS. iTALS applies a fast, ALS-based tensor factorization learning method that scales linearly with the number of non-zero elements in the tensor. The method also allows us to incorporate various contextual information into the model while maintaining its computational efficiency. We present two context-aware implementation variants of iTALS. The first incorporates seasonality and enables to distinguish user behavior in different time intervals. The other views the user history as sequential information and has the ability to recognize usage pattern typical to certain group of items, e.g. to automatically tell apart product types that are typically purchased repetitively or once. Experiments performed on five implicit datasets (LastFM IK, Grocery, VoD, and "implicitized" Netflix and MovieLens 10M) show that by integrating context-aware information with our factorization framework into the state-of-the-art implicit recommender algorithm the recommendation quality improves significantly.
机译:尽管基于隐式反馈的推荐问题(当只有用户历史记录可用而没有评级时)是现实应用中最典型的设置,但与显式反馈案例相比,它的研究要少得多。如果应该保持可伸缩性,那么在显式情况下有效的最新算法无法直接转换为隐式情况。隐式反馈基准数据集很少,因此通常会在显式基准上尝试新想法。在本文中,我们提出了一种通用的上下文感知隐式反馈推荐算法,称为iTALS。 iTALS应用了一种基于ALS的快速张量分解学习方法,该方法随张量中非零元素的数量线性缩放。该方法还允许我们将各种上下文信息合并到模型中,同时保持其计算效率。我们介绍了iTALS的两种上下文感知的实现变体。第一种结合了季节性,并能够区分不同时间间隔内的用户行为。另一个将用户历史记录视为顺序信息,并具有识别某些项目组(例如,特定项目组)所特有的使用模式的能力。自动区分通常重复购买或一次购买的产品类型。在五个隐式数据集(LastFM IK,Grocery,VoD以及“隐式”的Netflix和MovieLens 10M)上进行的实验表明,通过将上下文感知信息与我们的分解框架集成到最新的隐式推荐器算法中,推荐质量显着改善。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号