首页 | 本学科首页   官方微博 | 高级检索  
     

基于聚类系数的推荐算法*
引用本文:许鹏远,党延忠.基于聚类系数的推荐算法*[J].计算机应用研究,2016,33(3).
作者姓名:许鹏远  党延忠
作者单位:大连理工大学 系统工程研究所,大连理工大学管理与经济学部
基金项目:(71031002)资助和支持。
摘    要:摘 要:针对于标准二分图网络推荐算法(NBI)的物质扩散机制过于简单的问题,基于聚类系数的改进NBI算法(简称NBICC)被提出。在文章中,推荐系统可以被抽象为一个有向加权二分图网络。在物质扩散的过程中,考虑到聚类系数因素的影响,重新定义了商品之间的相似度的计算公式,进而获得了更加精确的推荐结果。Ranking score,precison,recall等评价指标被应用在本文提出的新算法中,实验结果表明,这三样重要指标上,NBICC算法都强于标准NBI算法。

关 键 词:推荐系统  有向加权图  聚类系数
收稿时间:2014/11/28 0:00:00
修稿时间:2016/1/26 0:00:00

A Modified Recommendation Algorithm Based on Clustering Coefficient
Xu Peng-yuan and Dang Yan-Zhong.A Modified Recommendation Algorithm Based on Clustering Coefficient[J].Application Research of Computers,2016,33(3).
Authors:Xu Peng-yuan and Dang Yan-Zhong
Affiliation:Institute of Systems Engineering,Dalian University of Technology,Liaoning Dalian,116024,China
Abstract:Abstract: Accordance with the problem that the mass diffusion mechanism which standard NBI algorithm used is too simple, a modified NBI algorithm based on clustering coefficient (NBICC) is proposed. In this article, recommendation system is regarded as a direct graph with weight. In order to obtaining more accurate result, the calculation formula of similarity was redefined by considering clustering coefficient in the process of mass diffusion. Numerical results indicating that the algorithmic accuracy, measured by the average ranking score, precision and recall is improved greatly.
Keywords:recommendation algorithm  direct graph with weight  clustering coefficient
点击此处可从《计算机应用研究》浏览原始摘要信息
点击此处可从《计算机应用研究》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号