【24h】

SCARS: A scalable context-aware recommendation system

机译:SCARS:可伸缩的上下文感知推荐系统

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

摘要

Recommender Systems (RS) are used to provide personalized suggestions for information, products and services that are not already used or experienced by a user, but are very likely to be preferred by him/her. Most of the existing RS employ variations of Collaborative Filtering (CF) for suggesting items relevant to users' interests. However, CF requires similarity computations that grows polynomially with the number of users and items in the database. In order to handle this scalability problem and speeding up the recommendation process, we propose a clustering based recommendation method. The proposed work utilizes the different user attributes such as age, gender, occupation, etc. as contextual features and then partitions the users' space on the basis of these attributes. We divide the entire users' space into smaller clusters based on the context, and then apply the recommendation algorithm separately to the clusters. This helps us to reduce the running time of the algorithm as we avoid computations over the entire data. In this work, we present a scalable CF framework that extends the traditional CF algorithms by incorporating users context into the recommendation process. While recommending to a target user in a specific cluster, our approach uses the ratings of the target user as well as the rating history of the other users in that cluster. One of the main objectives of our work is to reduce the running time without compromising the recommendation quality much. This ensures scalability, allowing us to tackle bigger datasets using the same resources. We have tested our algorithm on the MovieLens dataset, however, our recommendation approach is perfectly generalized. Experiments conducted indicate that our method is quite effective in reducing the running time.
机译:推荐系统(RS)用于为信息,产品和服务提供个性化建议,这些信息,产品和服务尚未被用户使用或体验过,但是很可能会被用户所偏爱。现有的大多数RS都采用协作过滤(CF)的变体来建议与用户兴趣相关的项目。但是,CF需要相似度计算,该相似度随数据库中用户和项目的数量成倍增长。为了解决此可扩展性问题并加快推荐过程,我们提出了一种基于聚类的推荐方法。拟议的工作利用不同的用户属性(例如年龄,性别,职业等)作为上下文特征,然后根据这些属性对用户的空间进行划分。我们根据上下文将整个用户空间划分为较小的群集,然后将推荐算法分别应用于这些群集。这有助于我们减少算法的运行时间,因为我们避免对整个数据进行计算。在这项工作中,我们提出了一个可扩展的CF框架,该框架通过将用户上下文纳入推荐过程来扩展传统的CF算法。在向特定集群中的目标用户推荐时,我们的方法使用目标用户的评级以及该集群中其他用户的评级历史记录。我们工作的主要目标之一是减少运行时间,而又不会大幅降低推荐质量。这确保了可伸缩性,使我们能够使用相同的资源处理更大的数据集。我们已经在MovieLens数据集上测试了我们的算法,但是,我们的推荐方法得到了完美的概括。进行的实验表明,我们的方法在减少运行时间方面非常有效。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号