arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2004.06469cs.SI
收藏

自适应影响力最大化的有效近似算法

Efficient Approximation Algorithms for Adaptive Influence Maximization

Keke Huang, Jing Tang, Kai Han, Xiaokui Xiao, Wei Chen, Aixin Sun, Xueyan Tang, Andrew Lim

摘要:

给定社交网络$G$和整数$k$,影响力最大化(IM)问题要求来自$G$的$k$节点的种子集$S$,以最大化经由传播模型受影响的节点的期望数量。大多数IM问题的现有算法仅在非自适应设置下开发,即,其中所有$k$种子节点在一个批次中被选择,而不观察它们如何影响现实世界中的其他用户。本文研究了自适应IM问题,在该问题中,$k$的种子节点是在等大小的$b$中分批选取的,使得在观察前$i-1$批次的实际影响结果后,识别出第$i$批次.在本文中,我们提出了第一个实用的算法,自适应IM问题,可以提供最坏情况下的近似保证$1-\mathrm{e}^{ρ_b(\varepsilon-1)}$,其中$ρ_b=1-(1-1/b)^b$和$\varepsilon \in (0, 1)$是一个用户指定的参数。特别是,我们提出了一个通用的框架AdaptGreedy,可以实例化的任何现有的非自适应IM算法与预期的近似保证。我们的方法是基于一种新的随机化的政策,适用于一般的自适应随机最大化问题,这可能是独立的利益。此外,我们提出了一种新的非自适应IM算法称为EPIC,它不仅提供了强大的预期近似保证,但也提出了优越的性能相比,现有的IM算法。同时,我们澄清了一些存在的误解,在最近的工作和自适应IM问题的进一步研究的启示。在真实的社交网络上进行了实验,对算法进行了全面的评估,实验结果有力地证实了算法的优越性和有效性。

英文摘要:

Given a social network $G$ and an integer $k$, the influence maximization (IM) problem asks for a seed set $S$ of $k$ nodes from $G$ to maximize the expected number of nodes influenced via a propagation model. The majority of the existing algorithms for the IM problem are developed only under the non-adaptive setting, i.e., where all $k$ seed nodes are selected in one batch without observing how they influence other users in real world. In this paper, we study the adaptive IM problem where the $k$ seed nodes are selected in batches of equal size $b$, such that the $i$-th batch is identified after the actual influence results of the former $i-1$ batches are observed. In this paper, we propose the first practical algorithm for the adaptive IM problem that could provide the worst-case approximation guarantee of $1-\mathrm{e}^{ρ_b(\varepsilon-1)}$, where $ρ_b=1-(1-1/b)^b$ and $\varepsilon \in (0, 1)$ is a user-specified parameter. In particular, we propose a general framework AdaptGreedy that could be instantiated by any existing non-adaptive IM algorithms with expected approximation guarantee. Our approach is based on a novel randomized policy that is applicable to the general adaptive stochastic maximization problem, which may be of independent interest. In addition, we propose a novel non-adaptive IM algorithm called EPIC which not only provides strong expected approximation guarantee, but also presents superior performance compared with the existing IM algorithms. Meanwhile, we clarify some existing misunderstandings in recent work and shed light on further study of the adaptive IM problem. We conduct experiments on real social networks to evaluate our proposed algorithms comprehensively, and the experimental results strongly corroborate the superiorities and effectiveness of our approach.

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

↑