Abstract
Given a social network G with n nodes and m edges, a positive integer k, and a cascade model C, the influence maximization (IM) problem asks for k nodes in G such that the expected number of nodes influenced by the k nodes under cascade model C is maximized. The state-of-the-art approximate solutions run in O(k(n+m)log n/ε2) expected time while returning a (1 - 1/e - ε) approximate solution with at least 1 - 1/n probability. A key phase of these IM algorithms is the random reverse reachable (RR) set generation, and this phase significantly affects the efficiency and scalability of the state-of-the-art IM algorithms.
In this article, we present a study on this key phase and propose an efficient random RR set generation algorithm under IC model. With the new algorithm, we show that the expected running time of existing IM algorithms under IC model can be improved to O(k ċ n log n ċ2), when for any node v, the total weight of its incoming edges is no larger than a constant. For the general IC model where the weights are skewed, we present a sampling algorithm SKIP. To the best of our knowledge, it is the first index-free algorithm that achieves the optimal time complexity of the sorted subset sampling problem.
Moreover, existing approximate IM algorithms suffer from scalability issues in high influence networks where the size of random RR sets is usually quite large. We tackle this challenging issue by reducing the average size of random RR sets without sacrificing the approximation guarantee. The proposed solution is orders of magnitude faster than states of the art as shown in our experiment.
Besides, we investigate the issues of forward propagation and derive its time complexity with our proposed subset sampling techniques. We also present a heuristic condition to indicate when the forward propagation approach should be utilized to estimate the expected influence of a given seed set.
- [1] 2013. KONECT Datasets. Retrieved June 2019 from http://konect.uni-koblenz.de/. (2013).Google Scholar
- [2] 2014. PMC code. Retrieved December 2021 from https://github.com/todo314/pruned-monte-carlo. (2014).Google Scholar
- [3] 2014. SNAP Datasets. Retrieved June 2019 from http://snap.stanford.edu/data. (2014).Google Scholar
- [4] 2015. IMM code. Retrieved June 2019 from https://sourceforge.net/projects/im-imm/. (2015).Google Scholar
- [5] 2017. OPIM-C code. Retrieved June 2019 from https://github.com/tangj90/OPIM. (2017).Google Scholar
- [6] 2017. SSA code. Retrieved June 2019 from https://github.com/hungnt55/Stop-and-Stare. (2017).Google Scholar
- [7] . 2017. Debunking the myths of influence maximization: An in-depth benchmarking study. In Proceedings of the SIGMOD. 651–666.Google ScholarDigital Library
- [8] . 2020. Efficient algorithms for budgeted influence maximization on massive social networks. Proceedings of the VLDB Endowment 13, 9 (2020), 1498–1510.Google ScholarDigital Library
- [9] . 2014. Maximizing social influence in nearly optimal time. In Proceedings of the SODA. 946–957.Google ScholarCross Ref
- [10] . 2004. Convex Optimization. Cambridge University Press.Google ScholarCross Ref
- [11] . 2017. Efficient sampling methods for discrete distributions. Algorithmica 79, 2 (2017), 484–508.Google ScholarDigital Library
- [12] . 2011. Limiting the spread of misinformation in social networks. In Proceedings of the WWW. 665–674.Google ScholarDigital Library
- [13] . 2015. Online topic-aware influence maximization. PVLDB 8, 6 (2015), 666–677.Google ScholarDigital Library
- [14] . 2010. Scalable influence maximization for prevalent viral marketing in large-scale social networks. In Proceedings of the SIGKDD. 1029–1038.Google ScholarDigital Library
- [15] . 2009. Efficient influence maximization in social networks. In Proceedings of the SIGKDD. 199–208.Google ScholarDigital Library
- [16] . 2014. IMRank: Influence maximization via finding self-consistent ranking. In Proceedings of the SIGIR. 475–484.Google ScholarDigital Library
- [17] . 2006. Survey: Concentration inequalities and martingale inequalities: A survey. Internet Mathematics 3, 1 (2006), 79–127.Google ScholarCross Ref
- [18] . 2014. Sketch-based influence maximization and computation: Scaling up with guarantees. In Proceedings of the CIKM. 629–638.Google ScholarDigital Library
- [19] . 1995. An optimal algorithm for monte carlo estimation (Extended Abstract). In Proceedings of the FOCS. 142–149.Google Scholar
- [20] . 2016. Holistic influence maximization: Combining scalability and efficiency with opinion-aware models. In Proceedings of the SIGMOD. 743–758.Google ScholarDigital Library
- [21] . 2011. Uncovering the temporal dynamics of diffusion networks. In Proceedings of the ICML. 561–568.Google Scholar
- [22] . 2010. Learning influence probabilities in social networks. In Proceedings of the WSDM. 241–250.Google ScholarDigital Library
- [23] . 2011. A data-based approach to social influence maximization. PVLDB 5, 1 (2011), 73–84.Google ScholarDigital Library
- [24] . 2011. CELF++: Optimizing the greedy algorithm for influence maximization in social networks. In Proceedings of the WWW. 47–48.Google ScholarDigital Library
- [25] . 2011. SIMPATH: An efficient algorithm for influence maximization under the linear threshold model. In Proceedings of the ICDM. 211–220.Google ScholarDigital Library
- [26] . 2020. Influence maximization revisited: Efficient reverse reachable set generation with bound tightened. In Proceedings of the SIGMOD. ACM, 2167–2181.Google ScholarDigital Library
- [27] . 2018. Efficient algorithms for adaptive influence maximization. PVLDB 11, 9 (2018), 1029–1040.Google ScholarDigital Library
- [28] . 2017. Revisiting the stop-and-stare algorithms for influence maximization. PVLDB 10, 9 (2017), 913–924.Google ScholarDigital Library
- [29] . 2012. IRIE: Scalable and robust influence maximization in social networks. In Proceedings of the ICDM. 918–923.Google ScholarDigital Library
- [30] . 2003. Maximizing the spread of influence through a social network. In Proceedings of the SIGKDD. 137–146.Google ScholarDigital Library
- [31] . 1997. The Art of Computer Programming. Vol. 3. Addison-Wesley.Google Scholar
- [32] . 2014. Submodular function maximization. In Proceedings of the Tractability: Practical Approaches to Hard Problems. Cambridge University, 71–104.Google ScholarCross Ref
- [33] . 2015. Online influence maximization. In Proceedings of the SIGKDD. 645–654.Google ScholarDigital Library
- [34] . 2015. Real-time targeted influence maximization for online advertisements. PVLDB 8, 10 (2015), 1070–1081.Google ScholarDigital Library
- [35] . 2012. Time constrained influence maximization in social networks. In Proceedings of the ICDM. 439–448.Google ScholarDigital Library
- [36] . 2015. From competition to complementarity: Comparative influence diffusion and maximization. PVLDB 9, 2 (2015), 60–71.Google ScholarDigital Library
- [37] . 2015. Influence at scale: Distributed computation of complex contagion in networks. In Proceedings of the SIGKDD. 735–744.Google ScholarDigital Library
- [38] . 2016. Cost-aware targeted viral marketing in billion-scale networks. In Proceedings of the INFOCOM. 1–9.Google ScholarDigital Library
- [39] . 2018. Revisiting of “Revisiting the Stop-and-Stare Algorithms for Influence Maximization”. In Proceedings of the CSoNet. 273–285.Google ScholarCross Ref
- [40] . 2017. Importance sketching of influence dynamics in billion-scale networks. In Proceedings of the ICDM. 337–346.Google ScholarCross Ref
- [41] . 2017. Outward influence and cascade size estimation in billion-scale networks. Proceedings of the ACM on Measurement and Analysis of Computing Systems 1, 1 (2017), 20:1–20:30.Google ScholarDigital Library
- [42] . 2016. Stop-and-stare: Optimal sampling algorithms for viral marketing in billion-scale networks. In Proceedings of the SIGMOD. 695–710.Google ScholarDigital Library
- [43] . 2014. Fast and accurate influence maximization on large networks with pruned monte-carlo simulations. In Proceedings of the AAAI. 138–144.Google ScholarCross Ref
- [44] . 2020. Influence maximization on undirected graphs: Toward closing the (1-1/e) gap. ACM Transactions on Economics and Computation 8, 4 (2020), 22:1–22:36.Google ScholarDigital Library
- [45] . 2019. Efficient approximation algorithms for adaptive seed minimization. In Proceedings of the SIGMOD. 1096–1113.Google ScholarDigital Library
- [46] . 2018. Online processing algorithms for influence maximization. In Proceedings of the SIGMOD. 991–1005.Google ScholarDigital Library
- [47] . 2015. Influence maximization in near-linear time: A martingale approach. In Proceedings of the SIGMOD. 1539–1554.Google ScholarDigital Library
- [48] . 2014. Influence maximization: Near-optimal time complexity meets practical efficiency. In Proceedings of the SIGMOD. 75–86.Google ScholarDigital Library
- [49] . 2018. Multi-objective maximization of monotone submodular functions with cardinality constraint. In Proceedings of the NeurIPS. 9513–9524.Google Scholar
- [50] . 1977. An efficient method for generating discrete random variables with general distributions. ACM Transactions on Mathematical Software 3, 3 (1977), 253–256.Google ScholarDigital Library
- [51] . 2017. Real-time influence maximization on dynamic social streams. PVLDB 10, 7 (2017), 805–816.Google ScholarDigital Library
Index Terms
- Influence Maximization Revisited: Efficient Sampling with Bound Tightened
Recommendations
Influence Maximization in Near-Linear Time: A Martingale Approach
SIGMOD '15: Proceedings of the 2015 ACM SIGMOD International Conference on Management of DataGiven a social network G and a positive integer k, the influence maximization problem asks for k nodes (in G) whose adoptions of a certain idea or product can trigger the largest expected number of follow-up adoptions by the remaining nodes. This ...
Influence Maximization Revisited: Efficient Reverse Reachable Set Generation with Bound Tightened
SIGMOD '20: Proceedings of the 2020 ACM SIGMOD International Conference on Management of DataGiven a social network G with n nodes and m edges, a positive integer k, and a cascade model C, the influence maximization (IM) problem asks for k nodes in G such that the expected number of nodes influenced by the k nodes under cascade model C is ...
Influence maximization: near-optimal time complexity meets practical efficiency
SIGMOD '14: Proceedings of the 2014 ACM SIGMOD International Conference on Management of DataGiven a social network G and a constant $k$, the influence maximization problem asks for k nodes in G that (directly and indirectly) influence the largest number of nodes under a pre-defined diffusion model. This problem finds important applications in ...
Comments