基于社区结构的影响力最大化算法

现有的社会网络影响力算法及模型的较高的时间复杂度已不适用于网络规模不断壮大的社会网络服务。针对上述问题,提出了一种基于网络社区结构的影响力最大化算法。首先评估各个社区中节点的影响力,挖掘其核心节点成员;继而在核心节点集和连接社区间的弱纽带节点中选取若干具有影响潜力的初始节点集,使其以最小的代价让信息在网络中得到最广泛的传播。实验结果表明:该算法不仅大大降低了时间复杂度,还获得了接近贪心算法的影响范围,影响覆盖率达到了90%以上。

Influence optimization model based on community structure

The relatively large time cost of the existing influence algorithms does not fit the social networks of which the scale keeps expanding. An influence optimization model was proposed based on the network community structure for solving problem of large time cost. Firstly evaluate nodes influence in each community and dig core members, and then find a small subset of nodes in the set composed of the core nodes and linking community nodes to get the maximization diffusion with minimization cost. The experimental results demonstrate that our model achieves the subset with more abroad influence diffusion and reduces running time compared with traditional methods. Its influence coverage is up to 90%.