提升节点以提高影响力传播
Boosting Nodes for Improving the Spread of Influence
摘要:
网络中的信息扩散最近受到了广泛的关注。大多数以前的工作解决的影响力最大化问题,选择一组合适的种子节点启动扩散过程,使最大数量的节点达到。由于种子选择问题是NP困难的,大多数解决方案都是次优的。此外,可以存在种子节点被预定的设置。因此,一个自然出现的问题是:给定一组种子节点,我们是否可以选择一小组节点,如果我们改善它们对扩散过程的反应,就可以实现扩散扩散的最大增加?我们称之为提升集选择问题。在本文中,我们形式化这个问题,研究其复杂性,并提出适当的算法。我们还评估了一些真实网络中的提升效果,并报告了不同种子集、扩散过程中的时间限制和其他扩散参数所实现的影响扩散的增加。
英文摘要:
Information diffusion in networks has received a lot of recent attention. Most previous work addresses the influence maximization problem of selecting an appropriate set of seed nodes to initiate the diffusion process so that the largest number of nodes is reached. Since the seed selection problem is NP hard, most solutions are sub-optimal. Furthermore, there may be settings in which the seed nodes are predetermined. Thus, a natural question that arise is: given a set of seed nodes, can we select a small set of nodes such that if we improve their reaction to the diffusion process, the largest increase in diffusion spread is achieved? We call this problem, the boost set selection problem. In this paper, we formalize this problem, study its complexity and propose appropriate algorithms. We also evaluate the effect of boosting in a number of real networks and report the increase of influence spread achieved for different seed sets, time limits in the diffusion process and other diffusion parameters.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。