计算机与现代化

• 算法设计与分析 • 上一篇    下一篇

 结合用户属性聚类的协同过滤推荐算法

  

  1. 扬州大学信息工程学院,江苏扬州225009
  • 收稿日期:2015-12-28 出版日期:2016-07-21 发布日期:2016-07-22
  • 作者简介: 林康(1988-),男,江苏徐州人,扬州大学信息工程学院硕士研究生,研究方向:大数据处理与推荐算法; 杨云(1967-),男,江苏扬州人,教授,硕士生导师,博士,研究方向:TCP/IP协议分析,无线网络技术。
  • 基金资助:
     国家自然科学基金资助项目(61402395); 江苏省自然科学基金资助项目(BK20140492)

 Collaborative Filtering Recommendation Algorithm Based on User Attributes Clustering

  1. College of Information Engineering, Yangzhou University, Yangzhou 225009, China
  • Received:2015-12-28 Online:2016-07-21 Published:2016-07-22

摘要:  协同过滤算法利用大量数据,通过研究用户的喜好可以为用户推荐其感兴趣的项目,在电子商务得到了广泛应用。然而,此类算法在面临扩展性、数据稀疏性和冷启动等问题时,出现推荐准确度下降和推荐效率偏低的问题。针对这些问题,本文引入用户属性相似度的概念,使用K-means聚类算法将用户划分到恰当用户簇,预测用户对项目的评分。然后,通过混合加权的方法,将基于用户属性的K均值聚类的推荐算法与基于项目的协同过滤算法相融合,提出综合用户属性的协同过滤算法。通过在MovieLens数据集上进行实验,结果表明本文所提出的算法具有可扩展性,同时在一定程度上缓解了冷启动问题,提高了推荐算法的预测准确度。

关键词:  , 协同过滤, K-means聚类, 用户属性, 冷启动

Abstract:  Collaborative filtering algorithm, which can recommend the items appeal to users from mass of data through studying the user’s preferences is widely used in electronic commerce. However, collaborative filtering algorithm suffers from decreasing accuracy and inefficiency in scalability, data sparsity, and cold start. In order to solve there problems, the concept of user attribute similarity is introduced in this paper, and the user can be divided into appropriate user clusters to predict the user’s ratings for a project by using K-means clustering algorithm. Furthermore, through fusing the recommendation algorithm based on user attributes and the collaborative filtering algorithms based on the project by using the method of mixed weights, a collaborative filtering algorithm synthesizing the attributes of user is proposed. Through experiment by using MovieLens data sets, we verify that the proposed algorithm has extensibility. Simultaneously, it can ease cold start problem and improve the prediction accuracy of recommendation algorithm in some degree.

Key words: collaborative filtering, K-means clustering, user attributes, cold start