Name
Abstract | ||
|---|---|---|
AbstractGiven a social network G, the influence maximization (IM) problem seeks a set S of k seed nodes in G to maximize the expected number of nodes activated via an influence cascade starting from S. Although a lot of algorithms have been proposed for IM, most of them only work under the non-adaptive setting, i.e., when all k seed nodes are selected before we observe how they influence other users. In this paper, we study the adaptive IM problem, where we select the k seed nodes in batches of equal size b, such that the choice of the i-th batch can be made after the influence results of the first i - 1 batches are observed. We propose the first practical algorithms for adaptive IM with an approximation guarantee of 1 − exp(ξ − 1) for b = 1 and 1 − exp(ξ − 1 + 1/e) for b > 1, where ξ is any number in (0, 1). Our approach is based on a novel AdaptGreedy framework instantiated by non-adaptive IM algorithms, and its performance can be substantially improved if the non-adaptive IM algorithm has a small expected approximation error. However, no current non-adaptive IM algorithms provide such a desired property. Therefore, we further propose a non-adaptive IM algorithm called EPIC, which not only has the same worst-case performance bounds with that of the state-of-the-art non-adaptive IM algorithms, but also has a reduced expected approximation error. We also provide a theoretical analysis to quantify the performance gain brought by instantiating AdaptGreedy using EPIC, compared with a naive approach using the existing IM algorithms. Finally, we use real social networks to evaluate the performance of our approach through extensive experiments, and the experimental experiments strongly corroborate the superiorities of our approach. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.14778/3213880.3213883 | Hosted Content |
Field | DocType | Volume |
Computer science,Algorithm,EPIC,Expected value,Cascade,Maximization,Approximation error | Journal | 11 |
Issue | ISSN | Citations |
9 | 2150-8097 | 7 |
PageRank | References | Authors |
0.44 | 16 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kai Han | 1 | 269 | 21.79 |
| Keke Huang | 2 | 61 | 4.83 |
| Xiaokui Xiao | 3 | 3266 | 142.32 |
| Jing Tang | 4 | 61 | 4.38 |
| Aixin Sun | 5 | 3071 | 156.89 |
| Xueyan Tang | 6 | 1559 | 92.36 |