一种基于社会势能的网络影响力最大化算法

A Social Potential Based Influence Maximization

社会网络影响力最大化问题是对于给定k值,寻找k个具有最大影响范围的节点集.这是一个优化问题并且是NP-完全的.该问题已经被成功地用于解决诸多实际问题,例如社交营销领域,社交广告策略制定等优化问题.文章介绍了社会网络影响力最大化的基本工作原理,从提取知识类型角度详细阐述了社会网络影响力最大化算法的研究现状和进展,鉴于现存的算法不能够有效地给出全局最优解,我们提出了一种基于社会势能的网络影响力最大化算法,利用实验结果揭示算法的有效性和可行性.

Influence maximization is a problem of finding k nodes as a set that could maximize the spread of influence. This is an optimal and NP-hard problem. This problem has already applied to many real world applications, such as social marketing, social advertising and so forth. In this paper, we first introduce the working principle of influence maximization in social net- works; from the knowledge type point of view,we illustrate the research status of related work. Due to existing algorithms cannot provide the global optimal solutions for this problem, we propose a social potential based influence maximization algorithm. Experiments results demonstrate the effectiveness and feasibility of proposedalgorithm.