中南民族大学学报（自然科学版）Issue(1)：103-107,5.
一种基于二部分图的推荐算法
Based on a Bipartite Graph of Recommendation Algorithm
摘要
Abstract
The foundation of this paper is the recommendation algorithm based on bipartite graph network structure, the collaborative filtering recommendation algorithm ( CF ) based on Pearson coefficients, and the fully sorting algorithm ( CRM) that is most widely used.After the detailed analysis of these algorithms, in consideration of their limitations, a new recommendation algorithm based on bipartite graph is proposed.Movielens database is drawn upon to compare NBI, CF, GRM and the proposed algorithm with two parameters.The results show that the accuracy of the recommendation produced by the proposed algorithm is higher than that of the other three algorithms except when recommending 50 movies to users.关键词
个性化推荐/数据挖掘/二部分图/推荐算法Key words
personalized recommendation/data mining/bipartite graph/recommendation algorithm分类
信息技术与安全科学引用本文复制引用
宋中山,王晓华..一种基于二部分图的推荐算法[J].中南民族大学学报（自然科学版）,2015,(1):103-107,5.基金项目
国家民委科研基金资助项目 （）
