首页> 外文期刊>Expert Systems with Application >EMUCF: Enhanced multistage user-based collaborative filtering through non-linear similarity for recommendation systems
【24h】

EMUCF: Enhanced multistage user-based collaborative filtering through non-linear similarity for recommendation systems

机译:emucf:通过推荐系统的非线性相似性增强基于多级用户的协作滤波

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

摘要

The data sparsity is an acute challenge in most of the collaborative filterings (CFs) as their performance is affected by the known ratings of target users. Recently, active learning has become a prevalent and straight forward approach to cope with the data sparsity. In this approach, the newly entered users are requested to rate certain items while they signup to the underlying recommendation system. This work proposes an Enhanced Multistage User-based CF (EMUCF) algorithm, which uses the concept of active learning and predicts the unknown ratings for target users in two stages. Here, the anonymous ratings of each intermediary stage are predicted with traditional User_CF algorithm. However, the similarity models commonly used in User_CF are not adequate to compute the similarity among users. Therefore, the most recently introduced Bhattacharyya Coefficient based nonlinear similarity model Bhat_sim is used for similarity computations; it utilizes all rating pairs of items in the final estimates of users similarities. Later, an extension of simple EMUCF, the (n 2)-stage EMUCF is proposed to increase the prediction accuracy by progressively increasing the density of the original rating matrix. The performance of simple EMUCF and its extension is evaluated on two benchmark Movielens-100K and Movielens-1M datasets. They obtain far superior results for prediction accuracy and recommendation precision compared to several prominent competing algorithms. Finally, the potential improvement in the n-stage EMUCF algorithm is assessed by establishing the connection between rating prediction accuracy and matrix density. (c) 2020 Elsevier Ltd. All rights reserved.
机译:数据稀疏性是大多数协作滤波(CFS)中的急性挑战,因为它们的性能受到目标用户的已知评级的影响。最近,积极学习已成为应对数据稀疏性的普遍和直接的方法。在这种方法中,请求新输入的用户在他们注册到基础推荐系统时对某些项目进行评分。这项工作提出了一种增强的基于多级用户的CF(emucf)算法,其使用主动学习的概念并预测两个阶段的目标用户的未知额定值。这里,通过传统的User_CF算法预测每个中间阶段的匿名评级。但是,user_cf中常用的相似性模型不足以计算用户之间的相似性。因此,最近引入的BHATTACHARYYA系数基于基于的非线性相似性模型BHAT_SIM用于相似性计算;它在最终估计用户相似之处使用了所有评级对项目。稍后,提出了一种简单的eMUCF的扩展,通过逐渐增加原始额定矩阵的密度来提高预测精度来提高预测精度。在两个基准Movielens-100k和Movielens-1M数据集中评估简单的MECUCF及其扩展的性能。与几个突出的竞争算法相比,它们获得了预测准确性和推荐精度的卓越结果。最后,通过建立额定值预测精度和矩阵密度之间的连接来评估N级新增算法的潜在改进。 (c)2020 elestvier有限公司保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号