Dmitri Goldenberg
ABSTRACT
The influence maximization problem aims to find the best seeding set of nodes in a network to increase the influence spread, under various information diffusion models. Recent advances have shown the importance of the timing of the seeding and introduced the sequential seeding approach, determining a step-by-step cascade of activations. Our study explores a novel Deterministic Influence Maximization Approach (DIMA) for time-based sequential seeding dynamics in a threshold-based model. We examine the problem characteristics and formulate solutions optimizing a scheduled sequential seeding strategy. Based on a set of empirical simulations we demonstrate the properties of the deterministic sequential problem, incorporate three different mathematical programming formulations and provide an initial benchmark for optimization techniques.
- J. Goldenberg, B. Libai, and E. Muller, "Using complex systems analysis to advance marketing theory development: Modeling heterogeneity effects on new product growth through stochastic cellular automata," Academy of Marketing Science Review, vol. 2001, p. 1, 2001.Google Scholar
- J. Tang, C. Aggarwal, and H. Liu, "Recommendations in signed social networks," in Proceedings of the 25th International Conference on World Wide Web, 2016, pp. 31--40.Google Scholar
- D. Kempe, J. Kleinberg, and É. Tardos, "Maximizing the spread of influence through a social network," in Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, 2003, pp. 137--146.Google ScholarDigital Library
- P. Shakarian, S. Eyre, and D. Paulo, "A scalable heuristic for viral marketing under the tipping model," Social Network Analysis and Mining, vol. 3, no. 4, pp. 1225--1248, 2013.Google ScholarCross Ref
- T. W. Valente, "Network interventions," Science, vol. 337, no. 6090, pp. 49--53, 2012.Google ScholarCross Ref
- S. P. Borgatti, "Centrality and network flow," Social networks, vol. 27, no. 1, pp. 55--71, 2005.Google ScholarCross Ref
- O. Hinz, B. Skiera, C. Barrot, and J. U. Becker, "Seeding strategies for viral marketing: An empirical comparison," Journal of Marketing, vol. 75, no. 6, pp. 55--71, 2011.Google ScholarCross Ref
- J. Leskovec, A. Krause, C. Guestrin, C. Faloutsos, J. VanBriesen, and N. Glance, "Cost-effective outbreak detection in networks," in Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, 2007, pp. 420--429.Google Scholar
- A. Goyal, W. Lu, and L. V. Lakshmanan, "Celf++: optimizing the greedy algorithm for influence maximization in social networks," in Proceedings of the 20th international conference companion on World wide web. ACM, 2011, pp. 47--48.Google Scholar
- K. Jung, W. Heo, and W. Chen, "Irie: Scalable and robust influence maximization in social networks," in Data Mining (ICDM), 2012 IEEE 12th International Conference on. IEEE, 2012, pp. 918--923.Google Scholar
- W. Chen, Y. Wang, and S. Yang, "Efficient influence maximization in social networks," in Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, 2009, pp. 199--208.Google Scholar
- W. Chen, C. Wang, and Y. Wang, "Scalable influence maximization for prevalent viral marketing in large-scale social networks," in Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, 2010, pp. 1029--1038.Google Scholar
- J. Jankowski, P. Bródka, P. Kazienko, B. K. Szymanski, R. Michalski, and T. Kajdanowicz, "Balancing speed and coverage by sequential seeding in complex networks," Scientific reports, vol. 7, no. 1, pp. 1--11, 2017.Google ScholarCross Ref
- D. Goldenberg, A. Sela, and E. Shmueli, "Timing matters: Influence maximization in social networks through scheduled seeding," IEEE Transactions on Computational Social Systems, vol. 5, no. 3, pp. 621--638, 2018.Google ScholarCross Ref
- A. Sela, D. Goldenberg, E. Shmueli, and I. Ben-Gal, "Scheduled seeding for latent viral marketing," in Advances in Social Networks Analysis and Mining (ASONAM), 2016 IEEE/ACM International Conference on. IEEE, 2016, pp. 642--643.Google Scholar
- J. Jankowski, M. Waniek, A. Alshamsi, P. Bródka, and R. Michalski, "Strategic distribution of seeds to support diffusion in complex networks," PloS one, vol. 13, no. 10, p. e0205130, 2018.Google ScholarCross Ref
- A. Goyal, F. Bonchi, and L. V. Lakshmanan, "Learning influence probabilities in social networks," in Proceedings of the third ACM international conference on Web search and data mining. ACM, 2010, pp. 241--250.Google Scholar
- R. M. Anderson, R. M. May, and B. Anderson, Infectious diseases of humans: dynamics and control. Wiley Online Library, 1992, vol. 28.Google Scholar
- F. Chierichetti, J. Kleinberg, and A. Panconesi, "How to schedule a cascade in an arbitrary graph," SIAM Journal on Computing, vol. 43, no. 6, pp. 1906--1920, 2014.Google ScholarDigital Library
- S. Lin, Q. Hu, F. Wang, and S. Y. Philip, "Steering information diffusion dynamically against user attention limitation," in Data Mining (ICDM), 2014 IEEE International Conference on. IEEE, 2014, pp. 330--339.Google Scholar
- A. Sela, D. Goldenberg, I. Ben-Gal, and E. Shmueli, "Active viral marketing: Incorporating continuous active seeding efforts into the diffusion model," Expert Systems with Applications, vol. 107, pp. 45--60, 2018.Google ScholarCross Ref
- T. Lev and E. Shmueli, "State-based targeted vaccination," Applied Network Science, vol. 6, no. 1, pp. 1--16, 2021.Google ScholarCross Ref
- T. Lev, I. Ben-Gal, and E. Shmueli, "Influence maximization through scheduled seeding in a real-world setting," IEEE Transactions on Computational Social Systems, 2021.Google ScholarCross Ref
- D. Goldenberg, J. Albert, L. Bernardi, and P. Estevez, "Free lunch! retrospective uplift modeling for dynamic promotions recommendation within roi constraints," in Fourteenth ACM Conference on Recommender Systems, 2020, pp. 486--491.Google ScholarDigital Library
- M. Gardner, "Mathematical games: The fantastic combinations of john conway's new solitaire game "life"," Scientific American, vol. 223, no. 4, pp. 120--123, 1970.Google ScholarCross Ref
- R. Albert and A.-L. Barabási, "Statistical mechanics of complex networks," Reviews of modern physics, vol. 74, no. 1, p. 47, 2002.Google ScholarCross Ref
- A.-L. Barabási, R. Albert, and H. Jeong, "Scale-free characteristics of random networks: the topology of the world-wide web," Physica A: statistical mechanics and its applications, vol. 281, no. 1, pp. 69--77, 2000.Google Scholar
- A. Beveridge and J. Shan, "Network of thrones," Math Horizons, vol. 23, no. 4, pp. 18--22, 2016.Google ScholarCross Ref
- P. Laborie, J. Rogerie, P. Shaw, and P. Vilím, "Ibm ilog cp optimizer for scheduling," Constraints, vol. 23, no. 2, pp. 210--250, 2018.Google ScholarDigital Library
- P. Bonacich, "Some unique properties of eigenvector centrality," Social networks, vol. 29, no. 4, pp. 555--564, 2007.Google ScholarCross Ref
- J. Leskovec and A. Krevl, "SNAP Datasets: Stanford large network dataset collection," http://snap.stanford.edu/data, Jun. 2014.Google Scholar
- D. Goldenberg, "Social network analysis: From graph theory to applications with python," in PyCon'19 - The 3rd Annual Israeli Python Conference, 2019.Google Scholar
- A. Hagberg, P. Swart, and D. S Chult, "Exploring network structure, dynamics, and function using networkx," Los Alamos National Lab.(LANL), Los Alamos, NM (United States), Tech. Rep., 2008.Google Scholar
- I. I. C. O. Studio-CPLEX, "Users manual-version 12 release 6," IBM ILOG CPLEX Division: Incline Village, NV, USA, 2013.Google Scholar
Index Terms
- Deterministic influence maximization approach for sequential active marketing
Index terms have been assigned to the content through auto-classification.
Recommendations
Robust Influence Maximization
KDD '16: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data MiningIn this paper, we address the important issue of uncertainty in the edge influence probability estimates for the well studied influence maximization problem --- the task of finding k seed nodes in a social network to maximize the influence spread. We ...
Stability and Robustness in Influence Maximization
In the well-studied Influence Maximization problem, the goal is to identify a set of k nodes in a social network whose joint influence on the network is maximized. A large body of recent work has justified research on Influence Maximization models and ...
VAIM: Visual Analytics for Influence Maximization
Graph Drawing and Network VisualizationAbstractIn social networks, individuals’ decisions are strongly influenced by recommendations from their friends and acquaintances. The influence maximization (IM) problem asks to select a seed set of users that maximizes the influence spread, i.e., the ...
Comments