作者: Maryam Adineh , Mostafa Nouri-Baygi
DOI: 10.1109/ICCKE.2018.8566515
关键词:
摘要: Influence maximization is the problem of selecting a subset individuals in social network that maximizes influence propagated network. With popularity sites, and development viral marketing, importance has been increased. Finding most influential vertices, called seeds, graph an NP-hard problem, therefore, time consuming. Many heuristics are proposed to find nearly good solution shorter time. In this paper, we propose two heuristic algorithms seed set. We evaluate our on several well-known datasets show achieve best results (up 800 improvements spread) for 10% improvement runtime).