基于改进二部图与专家信任的混合推荐算法

黄熠姿

摘要：针对传统协同过滤算法出现的稀疏数据、用户冷启动等问题以及复杂网络结构的广泛应用，本文提出结合改进的二部图与改进的专家信任算法来提高推荐准确度。基于普通二部图算法，将用户对项目的评分作为节点之间的分配资源权重，不仅关注用户与项目之间的联系，同时体现用户对项目的喜好程度；其次，本文根据用户的评论数和与该用户对项目评分相同的数目来判断该用户的专家信任度，改进传统系统过滤算法。为了提高推荐准确度，改进缺点，我们将两者算法进行加权混合，加权因子根据实验中最小MAE值对应的权值来确定，形成混合推荐算法。最后针对基于用户的协同过滤、传统二部图以及本文提出的混合算法计算MAE值和平均Hamming距离，对比分析本文算法的推荐准确度与多样性，实验表明本文方法推荐效果较好，准确率高，个性化强，有研究和应用价值。

Abstract： In view of the limitations like data sparseness， new users with little record of traditional collaborative filtering recommendation algorithm and the wide application of complex network structure， this paper argues to coalesce the recommendation algorithm based on expert trust and the modified bipartite graph recommendation algorithm. First of all， we proposed an improved recommendation algorithm based on weighted networks， not only pay attention to the connection between users and projects， but also reflect the users' preferences in projects. Secondly， the degree of expert trust is determined by user comments and project reviews. And in order to improve the accuracy of recommendation， we coalesce this two kinds of algorithm and give them weight. Finally， we determine the weights and calculate MAE and the average Hamming distance of the traditional collaborative filtering， the traditional bipartite graph and the hybrid recommendation algorithm through experiments， which shows that the hybrid recommendation algorithm has higher accuracy， stronger individuation， and more research and application value.

關键词：推荐算法；二部图；专家信任；加权混合

Key words： recommendation algorithm；bipartite graph；expert trust；weighted mixture

中图分类号：TP391.3 文献标识码：A 文章编号：1006-4311（2017）19-0160-05

0 引言

信息时代的迅速发展使人们能够方便快速地通过互联网获取各种电影资源，海量的电影资源及相应的用户评分信息很容易造成信息过载。已有很多研究证明电影的评分会对观影者的观影行为产生影响。以评分信息能够影响用户的观影行为为逻辑基础，研究者开始利用推荐技术对评分信息进行处理挖掘。既有的推荐算法包括：基于内容的推荐[1]、基于相似用户的协同过滤推荐[2]、基于知识的推荐[3]以及混合方法推荐[4]。……