首页> 外文会议>European Conference on Machine Learning and Principles and Practice of 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张于隐式反馈的背景知识意识推荐

获取原文

摘要

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 1K, 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的张量分解学习方法,其与张量中的非零元素的数量线性缩放。该方法还允许我们在维持其计算效率的同时将各种上下文信息结合到模型中。我们展示了两个语境感知的ITAL的实现变体。第一个包含季节性,并使能够以不同的时间间隔区分用户行为。另一个视图用户历史作为顺序信息,并且能够识别典型的使用模式,例如某些项目,例如,自动讲述通常或一次购买的产品类型。在五个隐式数据集(Lastfm 1k,杂货,Vod和“Imblicitized”Netflix和Movielens 10m)上执行的实验表明,通过将上下文信息与我们的分解框架集成到最先进的隐式推荐算法推荐质量显着改善。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号