Abstract
In many real-world situations, there exist two or more associated products, such as beer and nappy, mobile phone and mobile power pack, bed and mattress etc., in which consumers are likely to purchase these two or more associated products simultaneously. Thus, the associated products can be promoted at the same time, which implies cooperative influence spread of products in viral marketing. In this paper, we focus on maximizing the cooperative influence spread of associated products in a social network. First, we make use of a similarity model, abbreviated as SM, to generate the probabilities of edges. Then, we obtain the cooperative influence spread graph based on single influence spread graphs of these two products and the associated rule. Further, we propose independent cascade model with accepted probability (ICMAP) to describe the cooperative influence spread in a social network, and give an improved greedy algorithm to maximize the cooperative influence spread approximately. Experimental results show the effectiveness and feasibility of the proposed algorithm.
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
Similar content being viewed by others
References
Nail, J., Charron, C., Baxter, S.: The consumer advertising backlash. Forrester research and intelliseek market research report (2004)
Johnson, A.:
 Nike-tops-list-of-most-viral-brands-on-facebook-twitter (2010). http://www.kikabim.com/news/
Kempe, D., Kleinberg, J., Tardos, É.: Maximizing the spread of influence through a social network. In: SIGKDD, pp. 137–146 (2003)
He, X., Song, G., Chen, W., Jiang, Q.: Influence blocking maximization in social networks under the competitive linear threshold model. In: SDM, pp. 463–474 (2012)
Wu, H., Liu, W., Yue, K., Huang, W., Yang, K.: Maximizing the spread of competitive influence in a social network oriented to viral marketing. In: Li, J., Sun, Y., Dong, X.L., Yu, X., Sun, Y., Dong, X.L. (eds.) WAIM 2015. LNCS, vol. 9098, pp. 516–519. Springer, Heidelberg (2015). doi:10.1007/978-3-319-21042-1_53
Liu, Z., Hong, X., Peng, Z., Chen, Z., Wang, W., Song, T.: Minimizing the cost to win competition in social network. In: Cheng, R., Cui, B., Zhang, Z., Cai, R., Xu, J. (eds.) APWeb 2015. LNCS, vol. 9313, pp. 598–609. Springer, Heidelberg (2015). doi:10.1007/978-3-319-25255-1_49
Chen, W., Collins, A., Cummings, R., et al.: Influence maximization in social networks when negative opinions may emerge and propagate. In: SDM, pp. 379–390 (2011)
Nemhauser, G., Wolsey, L., Fisher, M.: An analysis of approximations for maximizing submodular set functions—I. Math. Program. 14(1), 265–294 (1978)
Datta, S., Majumder, A., Shrivastava, N.: Viral marketing for multiple products. In: ICDM, pp. 118–127 (2010)
Song, G., Zhou, X., Wang, Y., Xie, K.: Influence maximization on large-scale mobile social network: a divide-and-conquer method. IEEE Trans. Parallel Distrib. Syst. 26(5), 1379–1392 (2015)
Gomez-Rodriguez, M., Song, L., Du, N., Zha, H., Schölkopf, B.: Influence estimation and maximization in continuous-time diffusion networks. ACM Trans. Inf. Syst. 34(2), 9 (2016)
Tang, Y., Xiao, X., Shi, Y.: Influence maximization: near-optimal time complexity meets practical efficiency. In: SIGMOD, pp. 75–86 (2014)
Liang, W., Shen, C., Zhang, X.: UserGreedy: exploiting the activation set to solve influence maximization problem. In: Cheng, R., Cui, B., Zhang, Z., Cai, R., Xu, J. (eds.) APWeb 2015. LNCS, vol. 9313, pp. 561–572. Springer, Heidelberg (2015)
Leicht, E.A., Holme, P., Newman, M.E.J.: Vertex similarity in networks. Phys. Rev. E 73(2), 026120 (2006)
Han, J., Kamber, M., Pei, J.: Data Mining: Concepts and Techniques. Elsevier, Amsterdam (2011)
Krause, A., Guestrin, C.: Beyond convexity: submodularity in machine learning. ICML Tutorials (2008)
Acknowledgement
This paper was supported by the National Natural Science Foundation of China (Nos. 61472345, 61402398, 61232002), Natural Science Foundation of Yunnan Province (Nos. 2014FA023, 2013FB010), Program for Innovative Research Team in Yunnan University (No. XT412011), Program for Excellent Young Talents of Yunnan University (No. XT412003), and the Research Foundation of the Educational Department of Yunnan Province (No. 2014C134Y).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Wu, H., Zhang, Z., Yue, K., Zhang, B., Liu, W. (2016). Maximizing the Cooperative Influence Spread in a Social Network Oriented to Viral Marketing. In: Morishima, A., et al. Web Technologies and Applications. APWeb 2016. Lecture Notes in Computer Science(), vol 9865. Springer, Cham. https://doi.org/10.1007/978-3-319-45835-9_1
Download citation
DOI: https://doi.org/10.1007/978-3-319-45835-9_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-45834-2
Online ISBN: 978-3-319-45835-9
eBook Packages: Computer ScienceComputer Science (R0)