基于加权二部图的个性化推荐算法

基于加权二部图的个性化推荐算法
张新猛;蒋盛益
【期刊名称】《计算机应用》
【年(卷),期】2012(32)3
【摘要】针对网络推断(NBI)算法的二部图实现算法忽略二部图权重而导致实际评分值高的项目没有得到优先推荐这一问题,提出加权网络推断(WNBI)算法的加权二部图实现算法.该算法以项目的评分作为二部图中用户与项目的边权,按照用户-项目间边权占该节点权重和的比例分配资源,从而实现评分值高的项目得到优先推荐.通过在数据集MovieLens上的实验表明,相比NBI算法,WNBI算法命中高评分值项目数目增多,同时在推荐列表长度小于20的情况下,命中项目的数量和命中高评分项目数量均有明显增加.%In Network-Based Inference (NBI) algorithm, the weight of edge between user and item is ignored; therefore, the items with high rating have not got the priority to be recommended. In order to solve the problem, a Weigted Network-Based Inference (WNBI) algorithm was proposed. The edge between user and item was weighted with item's rating by proposed algorithm, the resources were allocated according to the ratio of the edge's weight to total edges' weight of the node, so that high rating items could be recommended with priority. The experimental results on data set MovieLens demonstrate that the number of hit high rating items by WNBI increases obviously in contrast with NBI, especially when the length of recommendation list is shorter than 20, the numbers of hit items and hit high rating items both increase.
【总页数】5页(P654-657,678)
【作者】张新猛;蒋盛益
【作者单位】广东外语外贸大学思科信息学院,广州510006;广东外语外贸大学思科信息学院,广州510006
【正文语种】中文
【中图分类】TP181;TP301.6
【相关文献】
1.基于增加相似度系数的加权二部图推荐算法 [J], 李镇东;罗琦;施力力
2.基于随机森林修正的加权二部图推荐算法 [J], 李玲;李晋宏
3.基于改进加权二部图和用户信任度的协同过滤推荐算法 [J], 邓小燕;张晓彬
4.基于加权二部图的个性化方案推荐 [J], 杨珍;耿秀丽
5.基于加权二部图的Slope One推荐算法 [J], 王冉;徐怡;胡善忠;何明慧
因版权原因，仅展示原文概要，查看原文内容请购买。