首页> 外文会议> >A Recommendation Algorithm Combining User Grade-Based Collaborative Filtering and Probabilistic Relational Models
【24h】

A Recommendation Algorithm Combining User Grade-Based Collaborative Filtering and Probabilistic Relational Models

机译:基于用户等级的协同过滤与概率关系模型相结合的推荐算法

获取原文

摘要

Collaborative filtering (CF) is a successful technology for building recommender systems. Unfortunately, it suffers from three limitations -- sparsity, scalability and cold start problem. To address these problems, a recommendation algorithm combining user grade-based collaborative filtering and Probabilistic Relational Models (UGCF-PRM) is presented. UGCF-PRM integrates user information, item information and user-item rating data, and uses an adaptive recommendation strategy for each user. In UGCF-PRM a user grade function is defined and a collaborative filtering based on this function is used, which can find neighbors for the target user efficiently. Because of the first-order character of Probabilistic Relational Models, UGCF-PRM can solve the cold start problem. The experiment results on the MovieLens data set show that UGCF-PRM performs better than a pure CF approach in both recommendation quality and recommendation efficiency.
机译:协作过滤(CF)是构建推荐系统的成功技术。不幸的是,它受到三个限制-稀疏性,可伸缩性和冷启动问题。为了解决这些问题,提出了一种结合了基于用户等级的协作过滤和概率关系模型(UGCF-PRM)的推荐算法。 UGCF-PRM集成了用户信息,项目信息和用户项目评级数据,并为每个用户使用了自适应推荐策略。在UGCF-PRM中,定义了用户等级功能,并使用了基于该功能的协作过滤,可以高效地找到目标用户的邻居。由于概率关系模型的一阶特性,UGCF-PRM可以解决冷启动问题。在MovieLens数据集上的实验结果表明,在推荐质量和推荐效率方面,UGCF-PRM的性能均优于纯CF方法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号