arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1907.09668cs.SIcs.DS
收藏

自适应种子最小化的有效近似算法

Efficient Approximation Algorithms for Adaptive Seed Minimization

Jing Tang, Keke Huang, Xiaokui Xiao, Laks V. S. Lakshmanan, Xueyan Tang, Aixin Sun, Andrew Lim

摘要:

作为影响力最大化的对偶问题,种子最小化问题要求种子节点的最小数量以影响给定社交网络$G$中所需数量的$η$用户。现有的种子最小化算法大多考虑非自适应设置,其中所有种子节点被选择在一个批次中,而不观察它们如何影响其他用户。在本文中,我们研究种子最小化的自适应设置,其中种子节点被选择在几个批次,这样一个批次的选择可以利用信息的实际影响,以前的批次。我们提出了一种新的算法,ASTI,它解决了自适应种子最小化问题的$O\Big(\frac{η\cdot (m+n)}{\varepsilon^2}\ln n \Big)$预期时间,并提供了一个近似的保证$\frac{(\ln η+1)^2}{(1 - (1-1/b)^b) (1-1/e)(1-\varepsilon)}$的期望,其中$η$是目标数量的影响节点,$b$是每个种子节点批次的大小,和$\varepsilon \in (0, 1)$是一个用户指定的参数。据我们所知,ASTI是第一个算法,提供了这样一个近似保证,而不会产生禁止计算开销。通过在各种数据集上的大量实验,我们证明了ASTI相对于竞争方法的有效性和效率。

英文摘要:

As a dual problem of influence maximization, the seed minimization problem asks for the minimum number of seed nodes to influence a required number $η$ of users in a given social network $G$. Existing algorithms for seed minimization mostly consider the non-adaptive setting, where all seed nodes are selected in one batch without observing how they may influence other users. In this paper, we study seed minimization in the adaptive setting, where the seed nodes are selected in several batches, such that the choice of a batch may exploit information about the actual influence of the previous batches. We propose a novel algorithm, ASTI, which addresses the adaptive seed minimization problem in $O\Big(\frac{η\cdot (m+n)}{\varepsilon^2}\ln n \Big)$ expected time and offers an approximation guarantee of $\frac{(\ln η+1)^2}{(1 - (1-1/b)^b) (1-1/e)(1-\varepsilon)}$ in expectation, where $η$ is the targeted number of influenced nodes, $b$ is size of each seed node batch, and $\varepsilon \in (0, 1)$ is a user-specified parameter. To the best of our knowledge, ASTI is the first algorithm that provides such an approximation guarantee without incurring prohibitive computation overhead. With extensive experiments on a variety of datasets, we demonstrate the effectiveness and efficiency of ASTI over competing methods.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑