融合共同评分用户数和项目兴趣关系的推荐算法  

Recommendation Algorithm Combing Number of Co-Rating Users and Interest Relationship of Items

作　　者：于阳[1] 陈道波 金鑫[3] 黄瑞阳[1] 

机构地区：[1]国家数字交换系统工程技术研究中心,河南郑州450002 [2]河南轻工职业学院,河南郑州450062 [3]国家计算机网络与信息安全管理中心,北京100031

出　　处：《信息工程大学学报》2017年第3期347-353,共7页Journal of Information Engineering University

基　　金：国家自然科学基金创新群体资助项目(61521003);国家自然科学基金资助项目(61171108);国家科技支撑计划资助项目(2014BAH30B01);国家973计划资助项目(2012CB315901;2012CB315905)

摘　　要：基于项目的协同过滤系统中,传统的cosine、pearson和jaccard等相似性计算方法都只从单一的角度衡量了项目之间的相似性,导致相似性计算结果不准确。协同过滤系统中普遍存在评分数据稀疏性问题,使这一现象更为严重。针对这些问题,提出了一种融合共同评分用户数和项目兴趣关系的推荐算法。算法根据项目间的同类性和共同评分用户数改进了Pearson相似性,引入用户对项目的兴趣度,基于用户建立项目之间兴趣度向量。实验结果表明:算法提高了推荐准确度,有效地缓解了评分数据稀疏性对传统相似性计算的影响。In the item-based collaborative fihering system, the traditional cosine, pearson, jaccard and other similarity calculation methods only measure the similarity between the items from a single point of view, resulting in inaccurate calculations of similarity. In addition, review data sparsity problem generally exists in collaborative filtering system, which makes this phenomenon more serious. To solve these problems, a recommendation algorithm combing the number of co-rating users between items and interest relationship of items is proposed. According to the similarity of items and the number of co-rating users, the algorithm improves the Pearson similarity. The algorithm intro- duces the degree of user interest for the items and establishes vector of interest among items based on the user. The experimental results show that the proposed algorithm can improve the accuracy of recommendation, and can effectively alleviate the impact of the sparse data on the traditional similarity calculation.

关 键 词：基于项目的协同过滤 相似性 稀疏性 兴趣度 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]