计算机应用 ›› 2012, Vol. 32 ›› Issue (03): 654-657.DOI: 10.3724/SP.J.1087.2012.00654

• 人工智能 • 上一篇    下一篇

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

张新猛,蒋盛益   

  1. 广东外语外贸大学 思科信息学院, 广州 510006
  • 收稿日期:2011-09-19 修回日期:2011-11-20 发布日期:2012-03-01 出版日期:2012-03-01
  • 通讯作者: 张新猛
  • 作者简介:张新猛(1974-),男,山东东明人,讲师,硕士,主要研究方向:数据挖掘;蒋盛益(1963-),男,湖南隆回人,教授,博士,CCF会员,主要研究方向:数据挖掘、网络安全。
  • 基金资助:

    国家自然科学基金资助项目(61070061)。

Personalized recommendation algorithm based on weighted bipartite network

ZHANG Xin-meng, JIANG Sheng-yi   

  1. Cisco School of Informatics, Guangdong University of Foreign Studies, Guangzhou Guangdong 510006,China
  • Received:2011-09-19 Revised:2011-11-20 Online:2012-03-01 Published:2012-03-01

摘要: 针对网络推断(NBI)算法的二部图实现算法忽略二部图权重而导致实际评分值高的项目没有得到优先推荐这一问题,提出加权网络推断(WNBI)算法的加权二部图实现算法。该算法以项目的评分作为二部图中用户与项目的边权,按照用户-项目间边权占该节点权重和的比例分配资源,从而实现评分值高的项目得到优先推荐。通过在数据集MovieLens上的实验表明,相比NBI算法,WNBI算法命中高评分值项目数目增多,同时在推荐列表长度小于20的情况下,命中项目的数量和命中高评分项目数量均有明显增加。

关键词: 二部图, 加权二部图, 个性化推荐

Abstract: 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.

Key words: bipartite network, weighted bipartite network, personalized recommendation

中图分类号: