首页> 外文会议>International Computer Conference, Computer Society of Iran >Incremental Matrix Factorization for Recommender Systems
【24h】

Incremental Matrix Factorization for Recommender Systems

机译:推荐系统的增量矩阵分解

获取原文

摘要

With the help of recommender systems, users can find information they do not know about, but they are interested in. These systems are a specific type of intelligent systems that track each user's behavior and discover their behavioral patterns. Among different approaches for implementing recommender systems, Matrix-Factorization (MF) based methods are so popular due to their high accuracy and scalability. However, in real world applications that new ratings are continuously coming, processing the huge amount of data is a computationally expensive task. In this paper, we present a novel incremental matrix factorization method to learn only parts of the data that have been changed or added recently. This way, there is no need to train the system from the scratch. The input data to the proposed recommender system is of two types, batch data and stream data. Batch data is the rating data that is already saved in the system and relates to the activities of users in the past. Stream data is the rating data that enters the system in each time interval. The method is evaluated on two versions of popular MovieLens dataset from GroupLens research. The experimental results confirm that our method reduces the execution time significantly while keeping the prediction error intact.
机译:在推荐系统的帮助下,用户可以找到他们不了解的信息,但他们感兴趣。这些系统是一种特定类型的智能系统,可以跟踪每个用户的行为并发现其行为模式。在实现推荐系统的不同方法中,由于它们的高精度和可扩展性,基于矩阵分解(MF)的方法非常受欢迎。然而,在现实世界中的应用程序中,新的评级不断提出,处理大量数据是计算昂贵的任务。在本文中,我们提出了一种新的增量矩阵分解方法,以仅限最近改变或添加的数据的几个部分。这样,无需从头开始训练系统。所提出的推荐系统的输入数据具有两种类型,批量数据和流数据。批量数据是已保存在系统中的评级数据,并与过去的用户活动相关。流数据是在每次间隔中进入系统的额定数据。该方法是在Grouplens Research的两个流行Movielens数据集的两个版本中进行评估。实验结果证实,我们的方法显着降低了执行时间,同时保持预测误差完好无损。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号