摘要
提出基于用户联系的信息网络中最具影响力用户的发现算法,基于现实社会网络启示得到的假定"与越多易受影响用户有联系的这类用户的影响力越大",且给出无向网络和有向网络中节点影响力的度量模型。实验表明,该方案优于求解影响力最大化的贪心算法达到的影响范围,能够较准确地刻画社会网络中节点影响力。
Proposes a most influential node finding algorithm based on complex user relationship, which is based on such hypothesis that the nodes with more easily affected neighborhood users have more chances to be affected. Gives the measurement method of undirected and directed network. Experiments show that the method exceeds the greedy algorithm of influence maximization on the spread influence and is more likely to depict the influence in social network accurately.
出处
《现代计算机》
2015年第2期6-9,共4页
Modern Computer
