Abstract
In this article, we evaluate, for the first time, the potential of a scheduled seeding strategy for influence maximization in a real-world setting. We first propose methods for analyzing historical data to quantify the infection probability of a node with a given set of properties in a given time and assess the potential of a given seeding strategy to infect nodes. Then, we examine the potential of a scheduled seeding strategy by analyzing a real-world large-scale dataset containing both the network topology as well as the nodes' infection times. Specifically, we use the proposed methods to demonstrate the existence of two important effects in our dataset: a complex contagion effect and a diminishing social influence effect. As shown in a recent study, the scheduled seeding approach is expected to benefit greatly from the existence of these two effects. Finally, we compare a number of benchmark seeding strategies to a scheduled seeding strategy that ranks nodes based on a combination of the number of infectious friends (NIF) they have, as well as the time that has passed since they became infectious. Results of our analyses show that for a seeding budget of 1%, the scheduled seeding strategy yields a convergence rate that is 14% better than a seeding strategy based solely on their degrees, and 215% better than a random seeding strategy, which is often used in practice.
Original language | English |
---|---|
Pages (from-to) | 494-507 |
Number of pages | 14 |
Journal | IEEE Transactions on Computational Social Systems |
Volume | 9 |
Issue number | 2 |
DOIs | |
State | Published - 1 Apr 2022 |
Keywords
- Influence maximization
- scheduled seeding
- social network analysis
All Science Journal Classification (ASJC) codes
- Modelling and Simulation
- Social Sciences (miscellaneous)
- Human-Computer Interaction