首页> 外文期刊>Management Science and Engineering >A Trust-Based Collaborative Filtering Algorithm Using a User Preference Clustering
【24h】

A Trust-Based Collaborative Filtering Algorithm Using a User Preference Clustering

机译:基于用户首选项聚类的基于信任的协同过滤算法

获取原文
       

摘要

Collaborative ?ltering is a widely adopted approach to recommendation, but sparse and high dimensional data are often barriers to providing high quality recommendations. Meanwhile, the traditional methods only utilize the information of the user-item rating matrix but ignore the trust relations between users, so their recommendation precision is often unsatisfactory. To address such issues, this paper constructs an user-preference matrix to reduce the data dimension and clusters the users by k-means clustering algorithm. Incorporating trust relationship, an improved similarity method is proposed to compute the similarity value. Then we find the nearest neighbor in the target user’s category according to the similarity; and predict the user’s prediction score by the nearest neighbor. At last we recommend the items with high prediction score to the user. This improved method has been tested via MovieLens 100K in order to make a comparison with the traditional techniques. The results have indicated that the proposed method can enhance performance of recommender systems.
机译:协作过滤是一种广泛采用的推荐方法,但是稀疏和高维数据通常是提供高质量推荐的障碍。同时,传统方法仅利用用户项目评分矩阵的信息,而忽略了用户之间的信任关系,因此其推荐精度往往不尽人意。为了解决这些问题,本文构造了一个用户偏好矩阵以减少数据量,并通过k均值聚类算法对用户进行聚类。结合信任关系,提出了一种改进的相似度计算方法。然后我们根据相似性找到目标用户类别中最接近的邻居;并根据最近的邻居预测用户的预测得分。最后,我们向用户推荐具有较高预测分数的商品。为了与传统技术进行比较,已通过MovieLens 100K测试了此改进方法。结果表明,该方法可以提高推荐系统的性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号