有限节点驱动的微博社会网络话题推荐方法

摘要

针对微博在线社会网络中的话题推荐问题，研究了如何选取多个驱动用户节点使得推荐话题能够得到大的传播广度，提出了一种新的信息推荐方法，可以求得次优的驱动节点集合使得推荐话题得到近似最大的传播广度。通过三个环节进行计算：通过修正的PageRank算法求得影响力大的节点；计算第一步得到的每个节点引起的话题传播广度；计算多个节点联合驱动时话题传播的广度，选择使传播广度最大的驱动节点集合。实验结果表明选取的近似最优驱动节点集合能够使得推荐信息得到更大广度的传播。%Aiming at the topic recommendation problem in online social networks, this paper focuses on how to find a set of driving nodes which can make the information diffusion broadly, and proposes a new recommendation method that can obtain an approximately optimal set of driving nodes. This method includes three steps:finding the candidate set of driving nodes which have the greatest influence with an extended PageRank algorithm; calculating the breadth of topic diffusion for each driving node in candidate set;and calculating the breadth of topic diffusion for a number of joint driving nodes and finding an approxi-mately optimal set of driving nodes. Experimental results show that the achieved approximately optimal driving node set leads to larger breadth of topic diffusion.