Abstract
Influence Maximization (IM) consists in finding in a network the top-k influencers who will maximize the diffusion of information. However, the exponential growth of online advertisement is due to Real-Time Bidding (RTB) which targets users on webpages. It requires complex ad placement decisions in real-time to face a high-speed stream of users. In order to stay relevant, the IM problem should be updated to answer RTB needs. While traditional IM generates a static set of influencers, they do not fit with an RTB environment which requires dynamic influence targeting. This paper proposes RTIM, the first IM algorithm capable of targeting users in a RTB environment. We also analyze influence scores of users in several social networks and provide a thorough experimental process to compare static versus dynamic IM solutions.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
Our model is not a Markov chain since the sum of a column can exceed 1.
References
Arora, A., Galhotra, S., Ranu, S.: Debunking the myths of influence maximization: an in-depth benchmarking study. In: SIGMOD, pp. 651–666. ACM (2017)
Borgs, C., Brautbar, M., Chayes, J., Lucier, B.: Maximizing social influence in nearly optimal time. In: SODA, pp. 946–957. Society for Industrial and Applied Mathematics, Philadelphia (2014)
Chen, W., Wang, C., Wang, Y.: Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: SGKDD, pp. 1029–1038. ACM, Washington, DC (2010)
Chen, W., Wang, Y., Yang, S.: Efficient influence maximization in social networks. In: SIGKDD, Paris, France, pp. 199–208 (2009)
Chen, W., Yuan, Y., Zhang, L.: Scalable influence maximization in social networks under the linear threshold model. In: ICDM, Sydney, Australia, pp. 88–97 (2010)
Cheng, S., Shen, H., Huang, J., Chen, W., Cheng, X.: IMRank: influence maximization via finding self-consistent ranking. In: SIGIR, pp. 475–484 (2014)
Cheng, S., Shen, H., Huang, J., Zhang, G., Cheng, X.: Static greedy: solving the apparent scalability-accuracy dilemma in influence maximization. CoRR abs/1212.4779 (2012)
Cohen, E., Delling, D., Pajor, T., Werneck, R.F.: Sketch-based influence maximization and computation: scaling up with guarantees. In: CIKM, Shanghai, China, pp. 629–638 (2014)
Domingos, P., Richardson, M.: Mining the network value of customers. In: SIGKDD, pp. 57–66. ACM, New York (2001)
Galhotra, S., Arora, A., Roy, S.: Holistic influence maximization: combining scalability and efficiency with opinion-aware models. In: SIGMOD, pp. 743–758. ACM, New York (2016)
Galhotra, S., Arora, A., Virinchi, S., Roy, S.: ASIM: a scalable algorithm for influence maximization under the independent cascade model. In: WWW, Florence, Italy, pp. 35–36 (2015)
Goyal, A., Bonchi, F., Lakshmanan, L.V.: Learning influence probabilities in social networks. In: WSDM, pp. 241–250. ACM, New York (2010)
Goyal, A., Lu, W., Lakshmanan, L.V.: CELF++: optimizing the greedy algorithm for influence maximization in social networks. In: WWW, pp. 47–48 (2011)
Goyal, A., Lu, W., Lakshmanan, L.V.: SIMPATH: an efficient algorithm for influence maximization under the linear threshold model. In: ICDM, Vancouver, BC, Canada, pp. 211–220 (2011)
Jung, K., Heo, W., Chen, W.: IRIE: scalable and robust influence maximization in social networks. In: ICDM, Brussels, Belgium, pp. 918–923 (2012)
Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. In: SIGKDD, pp. 137–146. ACM, New York (2003)
Leskovec, J., et al.: Cost-effective outbreak detection in networks. In: SIGKDD, pp. 420–429. ACM, NY (2007)
Leslie, P.H.: On the use of matrices in certain population mathematics. Biometrika 33(3), 183–212 (1945)
Li, Y., Zhang, D., Tan, K.L.: Real-time targeted influence maximization for online advertisements. PVLDB 8(10), 1070–1081 (2015)
Mandelbrot, B.B.: The Fractal Geometry of Nature, vol. 1. Freeman, New York (1982)
Sumith, N., Annappa, B., Bhattacharya, S.: Influence maximization in large social networks: Heuristics, models and parameters. Future Gene. Comp. Syst. 89, 777–790 (2018)
Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functions. Math. Prog. 14(1), 265–294 (1978)
Ohsaka, N., Akiba, T., Yoshida, Y., Kawarabayashi, K.: Fast and accurate influence maximization on large networks with pruned Monte-Carlo simulations. In: AAAI, Québec City, Québec, Canada, pp. 138–144 (2014)
Spencer, S., O’Connell, J., Greene, M.: The arrival of real-time bidding. Technical report, Google (2011)
Tang, Y., Shi, Y., Xiao, X.: Influence maximization in near-linear time: a martingale approach. In: SIGMOD, pp. 1539–1554. ACM, NY (2015)
Tang, Y., Xiao, X., Shi, Y.: Influence maximization: near-optimal time complexity meets practical efficiency. In: SIGMOD, pp. 75–86. ACM, NY (2014)
Yuan, S., Wang, J., Zhao, X.: Real-time Bidding for Online Advertising: Measurement and Analysis. CoRR abs/1306.6542 (2013)
Zhang, M., Dai, C., Ding, C., Chen, E.: Probabilistic solutions of influence propagation on social networks. In: CIKM, pp. 429–438. ACM, NY (2013)
Acknowledgments
This work was supported by Kwanko.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Dupuis, D., du Mouza, C., Travers, N., Chareyron, G. (2019). RTIM: A Real-Time Influence Maximization Strategy. In: Cheng, R., Mamoulis, N., Sun, Y., Huang, X. (eds) Web Information Systems Engineering – WISE 2019. WISE 2020. Lecture Notes in Computer Science(), vol 11881. Springer, Cham. https://doi.org/10.1007/978-3-030-34223-4_18
Download citation
DOI: https://doi.org/10.1007/978-3-030-34223-4_18
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-34222-7
Online ISBN: 978-3-030-34223-4
eBook Packages: Computer ScienceComputer Science (R0)