TL;DR本研究提出了一种名为 CauIM 的新算法,通过重建每个节点的 ITE,并采用加权贪婪算法最大化受感染者 ITE 之和,以实现影响传播的合理目标。实验结果表明,CauIM 在超图流行度最大化方面表现卓越,超越了以前的 IM 和随机方法。
Abstract
influence maximization (IM) is the task of selecting a fixed number of seed
nodes in a given network to maximize dissemination benefits. Although the
research for efficient algorithms has been dedicated recently, it is usually
neglected to further explore the graph structure and the ob