促进信息传播:一种数学方法
Boosting Information Spread: An Algorithmic Approach
摘要:
影响力最大化(IM)的研究主要集中在有影响力的种子,以触发大量的信息在社交网络中传播。在本文中,我们考虑了一个新的和补充的问题,如何进一步增加给定的种子的影响传播。我们的研究动机是观察到直接激励可以“促进”用户,使他们更有可能受到朋友的影响。我们研究了$k$ -boosting问题,其目的是找到$k$用户,以提高,使最终的“提升”的影响力传播最大化。$k$ -boosting问题与IM问题不同,因为boosted用户的行为与seeder不同:boosted用户最初不受影响,我们只增加他们受影响的概率。我们的工作也补充了IM研究,因为我们专注于在给定播种者的基础上触发更大的影响力传播。问题的NP-困难性和目标函数的非子模块性都对$k$ -boosting问题提出了挑战。为了解决一般图的问题,我们设计了两个有效的算法与数据依赖的近似比。对于双向树上的$k$ -boosting问题,我们提出了一个有效的贪心算法和一个四舍五入的动态规划,这是一个完全多项式时间的近似计划。我们使用真实的社交网络和合成双向树进行了广泛的实验。我们表明,我们的算法返回的提升解决方案实现了提升的影响力,比直观基线返回的提升解决方案高出数倍,而直观基线无法保证解决方案的质量。我们还探讨了“预算分配”的问题,在我们的实验。与只针对种子用户分配预算相比,将预算同时分配给种子用户和提升用户可以获得更大的影响力扩散。
英文摘要:
The majority of influence maximization (IM) studies focus on targeting influential seeders to trigger substantial information spread in social networks. In this paper, we consider a new and complementary problem of how to further increase the influence spread of given seeders. Our study is motivated by the observation that direct incentives could "boost" users so that they are more likely to be influenced by friends. We study the $k$-boosting problem which aims to find $k$ users to boost so that the final "boosted" influence spread is maximized. The $k$-boosting problem is different from the IM problem because boosted users behave differently from seeders: boosted users are initially uninfluenced and we only increase their probability to be influenced. Our work also complements the IM studies because we focus on triggering larger influence spread on the basis of given seeders. Both the NP-hardness of the problem and the non-submodularity of the objective function pose challenges to the $k$-boosting problem. To tackle the problem on general graphs, we devise two efficient algorithms with the data-dependent approximation ratio. For the $k$-boosting problem on bidirected trees, we present an efficient greedy algorithm and a rounded dynamic programming that is a fully polynomial-time approximation scheme. We conduct extensive experiments using real social networks and synthetic bidirected trees. We show that boosting solutions returned by our algorithms achieves boosts of influence that are up to several times higher than those achieved by boosting solutions returned by intuitive baselines, which have no guarantee of solution quality. We also explore the "budget allocation" problem in our experiments. Compared with targeting seeders with all budget, larger influence spread is achieved when we allocation the budget to both seeders and boosted users.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。