Abstract
Given a social network G, the Influence Maximization (IM) problem aims to find a seed set \(S \subseteq G\) of k users. These users are advertised, or activated, through marketing campaigns, with the hope that they will continue to influence others in G (e.g., by spreading messages about a new book). The goal of IM is to find the set S that achieves an optimal advertising effect or expected spread (e.g., make the largest number of users in G know about the book).
Existing IM solutions make extensive use of propagation models, such as Linear Threshold (LT) or the Independent Cascade (IC). These models define the activation probability, or the chance that a user successfully gets activated by his/her neighbors in G. Although these models are well-studied, they overlook the fact that a user’s influence on others decreases with time. This can lead to an over-estimation of activation probabilities, as well as the expected spread.
To address the drawbacks of LT and IC, we develop a new propagation model, called Awareness Threshold (or AT), which considers the fact that a user’s influence decays with time. We further study the Scheduled Influence Maximization (or SIM), to find out the set S of users to activate, as well as when they should be activated. The SIM problem considers the time-decaying nature of influence based on the AT model. We show that the problem is NP-hard, and we develop three approximation solutions with accuracy guarantees. Extensive experiments on real social networks show that (1) AT yields a more accurate estimation of activation probability; and (2) Solutions to the SIM gives a better expected spread than IM algorithms on the AT model.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
https://www.dropbox.com/s/zhqnvsy5a5xocfa/simpath_icdm11_datasets.zip?dl=0
Almon, S.: The distributed lag between capital appropriations and expenditures. Econom.: J. Econom. Soc. 33, 178–196 (1965)
Bharathi, S., Kempe, D., Salek, M.: Competitive influence maximization in social networks. In: Deng, X., Graham, F.C. (eds.) WINE 2007. LNCS, vol. 4858, pp. 306–311. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-77105-0_31
Borgs, C., Brautbar, M., Chayes, J., Lucier, B.: Maximizing social influence in nearly optimal time. In: SODA (2014)
Broadbent, S.: Accountable Advertising: A Handbook for Managers and Analysts. Admap Publications, Henley-on-Thames (1997)
Brown, G.: Modelling advertising awareness. Statistician 35, 289–299 (1986)
Chen, S., Fan, J., Li, G., Feng, J., Tan, K.-L., Tang, J.: Online topic-aware influence maximization. PVLDB 8, 666–677 (2015)
Chen, W., Lu, W., Zhang, N.: Time-critical influence maximization in social networks with time-delayed diffusion process. In: AAAI (2012)
Chen, W., Wang, C., Wang, Y.: Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: KDD (2010)
Chen, W., Wang, Y., Yang, S.: Efficient influence maximization in social networks. In: KDD (2009)
Dubé, J.-P., Hitsch, G.J., Manchanda, P.: An empirical model of advertising dynamics. Quant. Mark. Econ. 3, 107–144 (2005)
Feng, S., Chen, X., Cong, G., Zeng, Y., Chee, Y.M., Xiang, Y.: Influence maximization with novelty decay in social networks. In: AAAI (2014)
Ferguson, R.: Word of mouth and viral marketing: taking the temperature of the hottest trends in marketing. J. Consum. Mark. 25, 179–182 (2008)
Fry, T.R., Broadbent, S., Dixon, J.M., et al.: Estimating advertising half-life and the data interval bias. Technical report, Monash University, Department of Econometrics and Business Statistics (1999)
Goyal, A., Bonchi, F., Lakshmanan, L.V.: Learning influence probabilities in social networks. In: WSDM (2010)
Goyal, A., Bonchi, F., Lakshmanan, L.V.: A data-based approach to social influence maximization. PVLDB 5, 73–84 (2011)
Goyal, A., Lu, W., Lakshmanan, L.V.: CELF++: optimizing the greedy algorithm for influence maximization in social networks. In: WWW (2011)
Goyal, A., Lu, W., Lakshmanan, L.V.: Simpath: an efficient algorithm for influence maximization under the linear threshold model. In: ICDM (2011)
He, X., Song, G., Chen, W., Jiang, Q.: Influence blocking maximization in social networks under the competitive linear threshold model. In: Proceedings of the 2012 SIAM International Conference on Data Mining, pp. 463–474. SIAM (2012)
Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. In: KDD (2003)
Kempe, D., Kleinberg, J., Tardos, É.: Influential nodes in a diffusion model for social networks. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1127–1138. Springer, Heidelberg (2005). https://doi.org/10.1007/11523468_91
Kim, J., Kim, S.-K., Yu, H.: Scalable and parallelizable processing of influence maximization for large-scale social networks? In: ICDE (2013)
Kirby, J.: Viral marketing. In: Connected marketing (2012)
Lei, S., Maniu, S., Mo, L., Cheng, R., Senellart, P.: Online influence maximization. In: KDD (2015)
Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., VanBriesen, J., Glance, N.: Cost-effective outbreak detection in networks. In: KDD (2007)
Li, G., Chen, S., Feng, J., Tan, K.-L., Li, W.: Efficient location-aware influence maximization. In: SIGMOD (2014)
Lin, S.-C., Lin, S.-D., Chen, M.-S.: A learning-based framework to handle multi-round multi-party influence maximization on social networks. In: KDD (2015)
Liu, B., Cong, G., Xu, D., Zeng, Y.: Time constrained influence maximization in social networks. In: ICDM (2012)
Lu, W., Chen, W., Lakshmanan, L.V.: From competition to complementarity: comparative influence diffusion and maximization. PVLDB 9, 60–71 (2015)
Mohammadi, A., Saraee, M., Mirzaei, A.: Time-sensitive influence maximization in social networks. J. Inf. Sci. 41, 765–778 (2015)
Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functions. Math. Program. 14, 265–294 (1978)
Ohsaka, N., Yamaguchi, Y., Kakimura, N., Kawarabayashi, K.: Maximizing time-decaying influence in social networks. In: Frasconi, P., Landwehr, N., Manco, G., Vreeken, J. (eds.) ECML PKDD 2016. LNCS (LNAI), vol. 9851, pp. 132–147. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-46128-1_9
Steeg, G.V., Ghosh, R., Lerman, K.: What stops social epidemics? In: ICWSM (2011)
Tang, Y., Shi, Y., Xiao, X.: Influence maximization in near-linear time: a martingale approach. In: SIGMOD (2015)
Tang, Y., Xiao, X., Shi, Y.: Influence maximization: near-optimal time complexity meets practical efficiency. In: SIGMOD (2014)
Zhang, Z., Wu, H., Yue, K., Li, J., Liu, W.: Influence maximization for cascade model with diffusion decay in social networks. In: Che, W., et al. (eds.) ICYCSEE 2016. CCIS, vol. 623, pp. 418–427. Springer, Singapore (2016). https://doi.org/10.1007/978-981-10-2053-7_37
Acknowledgment
We would like to thank the reviewers for the insightful comments. Haiqi Sun, Jing Yan, Yudian zheng, and Reynold Cheng were supported by the Research Grants Council of Hong Kong (RGC Projects HKU 17229116 and 17205115) and the University of Hong Kong (Projects 104004572, 102009508, 104004129).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Sun, H., Cheng, R., Xiao, X., Yan, J., Zheng, Y., Qian, Y. (2018). Maximizing Social Influence for the Awareness Threshold Model. In: Pei, J., Manolopoulos, Y., Sadiq, S., Li, J. (eds) Database Systems for Advanced Applications. DASFAA 2018. Lecture Notes in Computer Science(), vol 10827. Springer, Cham. https://doi.org/10.1007/978-3-319-91452-7_32
Download citation
DOI: https://doi.org/10.1007/978-3-319-91452-7_32
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-91451-0
Online ISBN: 978-3-319-91452-7
eBook Packages: Computer ScienceComputer Science (R0)