Computer Science ›› 2017, Vol. 44 ›› Issue (Z11): 391-396.doi: 10.11896/j.issn.1002-137X.2017.11A.082

Previous Articles     Next Articles

Collaborative Filtering Recommendation Algorithm Combining Clustering and User Preferences

HE Ming, SUN Wang, XIAO Run and LIU Wei-shi   

  • Online:2018-12-01 Published:2018-12-01

Abstract: Collaborative filtering recommendation algorithm can use the known user preferences to predict the possible interest items,and it is now the most successful and widely used recommendation technique.However,traditional collaborative filtering recommendation algorithms suffer from data sparsity,which results in poor recommendation accuracy.Only user-item rating matrix has been used to data analysis by most current collaborative filtering algorithms,while the characteristics of the item attributes and user preferences for those who have not been considered.To address this issue,a collaborative filtering recommendation algorithm combing clustering and user preference was proposed in this paper.Firstly,the user preference matrix for the item category is constructed according to the user rating matrix and the item category information.Then the K-Means algorithm is used to cluster the item set,and the nearest-neighbor user corresponding to the unrated item is found based on the user preference matrix.Next,the sparse matrix in each item cluster is filled by the weight Slope One algorithm combined with the similarity of items to alleviate the problem of data sparsity.In addition,the user clusters are built based on the user interest matrix.Finally,the user based collaborative filtering algorithm in each user cluster is employed to predict the item rating for the filled rating matrix.The experimental results show that our algorithm effectively alleviates the sparsity problem of the raw rating matrix and achieves better quality of recommendation than other algorithms.

Key words: Recommender systems,Collaborative filtering,Clustering algorithm

[1] ADOMAVICIUS G,TUZHILIN A.Toward the next generation of recommender systems:a survey of the state-of-the-art and possible extensions [J].IEEE Transactions on Knowledge and Data Engineering,2005,17(6):734-749.
[2] 黄创光,印鉴,汪静,等.不确定近邻的协同过滤推荐算法[J].计算机学报,2010,33(8):1370-1377.
[3] 孟祥武,刘树栋,张玉洁,等.社会化推荐系统研究[J].软件学报,2015,26(6):1356-1372.
[4] 张锋,孙雪冬,常会友,等.两方参与的隐私保护协同过滤推荐研究[J].电子学报,2009,37(1):84-89.
[5] 吴湖,王永吉,王哲,等.两阶段联合聚类协同过滤算法[J].软件学报,2010,21(5):1042-1054.
[6] 韦素云,业宁,朱健,等.基于项目聚类的全局最近邻的协同过滤算法[J].计算机科学,2012,39(12):149-152.
[7] HUANG Y X,CUI B,ZHANG W Y,et al.TencentRec:Real-time stream recommendation in practice[C]∥Proceedings of ACM SIGMOD International Conference on Management of Data.2015:227-238.
[8] 郭兰杰,梁吉业,赵兴旺.融合社交网络信息的协同过滤推荐算法[J].模式识别与人工智能,2016,29(3):281-288.
[9] 罗辛,欧阳元新,熊璋,等.通过相似度支持度优化基于K近邻的协同过滤算法[J].计算机学报,2010,33(8):1437-1445.
[10] HAN J W,KAMBER M.Data Mining:Concepts and Techniques [M].San Francisco:Morgan Kaufmann Publishers,2006.
[11] Apache Mahout [EB/OL].[2016-09-23]
[12] MovieLens datasets [EB/OL].[2016-11-03]
[13] 丁少衡,姬东鸿,王路路.基于用户属性和评分的协同过滤推荐算法[J].计算机工程与设计,2015(2):487-491.

No related articles found!
Full text



No Suggested Reading articles found!