计算机科学与探索2017，Vol.11Issue(5)：720-731,12.DOI:10.3778/j.issn.1673-9418.1605063
边缘覆盖去重的社交网络影响力最大化算法
Edge-Cover Algorithm for Influence Maximization in Social Network
摘要
Abstract
Influence maximization is a problem of obtaining a subset of nodes in social network to maximize the influence spread.Aiming at the problem of the poor accuracy of heuristic algorithm,existing works consider the overlapped range,and ignore the problem of edge contributions.This paper focuses on how to select a seed set that has the maximum influence based on edge contributions.The algorithm evaluates the influence of information spread by calculating the global influence and adjacent influence.Then it removes the selected node influence range and updates the network to eliminate the interference of edge contributions to node influence evaluation.Finally,this paper proposes an edge-cover algorithm for influence maximization based on independent cascade model.The experimental results show that the proposed algorithm has a greater impact on the spread of range.关键词
社交网络/影响力最大化/边缘贡献/启发式算法Key words
social network/influence maximization/edge contributions/heuristic algorithm分类
信息技术与安全科学引用本文复制引用
胡敏,孙欣然,黄宏程..边缘覆盖去重的社交网络影响力最大化算法[J].计算机科学与探索,2017,11(5):720-731,12.基金项目
The National Natural Science Foundation of China under Grant No.61401051(国家自然科学基金) （国家自然科学基金）
the Foundation and Frontier Research Project of Chongqing Science and Technology Commission under Grant No.cstc2014jcyjA40039(重庆市科委基础和前沿研究项目) （重庆市科委基础和前沿研究项目）
the Science and Technology Research Project of Chongqing Municipal Education Committee under Grant No.J1400402(重庆市教委科学技术研究项目). （重庆市教委科学技术研究项目）
