首页> 外文会议>International conference on intelligent data engineering and automated learning >Joining Items Clustering and Users Clustering for Evidential Collaborative Filtering
【24h】

Joining Items Clustering and Users Clustering for Evidential Collaborative Filtering

机译:连接项聚类和用户聚类,以进行证据协同过滤

获取原文

摘要

Recommender Systems (RSs) are supporting users to cope with the flood of information. Collaborative Filtering (CF) is one of the most well-known approaches that have achieved a widespread success in RSs. It consists in picking out the most similar users or the most similar items to provide recommendations. Clustering techniques can be adopted in CF for grouping these similar users or items into some clusters. Nevertheless, the uncertainty comprised throughout the clusters assignments as well as the final predictions should also be considered. Therefore, in this paper, we propose a CF recommendation approach that joins both users clustering strategy and items clustering strategy using the belief function theory. In our approach, we carry out an evidential clustering process to cluster both users and items based on past preferences and predictions are then performed accordingly. Joining users clustering and items clustering improves the scalability and the performance of the traditional neighborhood-based CF under an evidential framework.
机译:推荐系统(RS)支持用户应对大量信息。协同过滤(CF)是在RS中获得广泛成功的最著名的方法之一。它包括挑选出最相似的用户或最相似的项以提供建议。 CF中可以采用聚类技术,以将这些相似的用户或项目分组为一些聚类。尽管如此,整个集群分配中的不确定性以及最终预测也应予以考虑。因此,在本文中,我们提出了一种使用信念函数理论将用户聚类策略和项目聚类策略结合在一起的CF推荐方法。在我们的方法中,我们执行了证据聚类过程,根据过去的偏好对用户和商品进行聚类,然后进行相应的预测。在证据框架下,加入用户群集和项目群集可以提高传统的基于邻域的CF的可伸缩性和性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号