Abstract
In emerging applications of social networks, groups play a vital role as most decisions are made by groups according to the opinion of the majority therein. This brings the problem of Group Influence Maximization (GIM) which aims to select k initial active nodes for maximizing the expected number of influenced groups. In the paper, we study GIM and focus on activating groups rather than individuals. Observing the known NP-hardness of GIM and the \(\#P\)-hardness of computing the objective function under Independent Cascade (IC) model, we devise an algorithm called Complementary Maximum Coverage (CMC) based on analyzing the influence of the nodes over the groups, ensuring the task of maximizing the number of activated groups. In addition, we also propose an algorithm called Improved Reverse Influence Sampling (IRIS) via adjusting the famous Reverse Influence Sampling (RIS) algorithm for GIM. Lastly, experiments are carried out to demonstrate that our CMC and IRIS both outperform the known baselines including Maximum Coverage and Maximum Out-degree algorithms in the average number of activated groups under IC model.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Mary, M., Wu, L.: Internet trends 2018 (2018)
Domingos, P., Richardson, M.: Mining the network value of customers, pp. 57–66 (2001)
Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network, pp. 137–146 (2003)
Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., Vanbriesen, J.M., Glance, N.: Cost-effective outbreak detection in networks, pp. 420–429 (2007)
Goyal, A., Lu, W., Lakshmanan, L.V.S.: Celf++: optimizing the greedy algorithm for influence maximization in social networks, pp. 47–48 (2011)
Chen, W., Wang, Y., Yang, S.: Efficient influence maximization in social networks, pp. 199–208 (2009)
Wasserman, S., Faust, K.: Social Network Analysis: Social Network Analysis in the Social and Behavioral Sciences. Cambridge University Press, Cambridge (1994)
Estevez, P.A., Vera, P.A., Saito, K.: Selecting the most influential nodes in social networks, pp. 2397–2402 (2007)
Borgs, C., Brautbar, M., Chayes, J., Lucier, B.: Maximizing social influence in nearly optimal time, pp. 946–957 (2014)
Tang, Y., Xiao, X., Shi, Y.: Influence maximization: near-optimal time complexity meets practical efficiency, pp. 75–86 (2014)
Tang, Y., Shi, Y., Xiao, X.: Influence maximization in near-linear time: a martingale approach, pp. 1539–1554 (2015)
Nguyen, H.T., Thai, M.T., Dinh, T.N.: Stop-and-stare: optimal sampling algorithms for viral marketing in billion-scale networks, pp. 695–710 (2016)
Cao, T., Wu, X., Wang, S., Hu, X.: Oasnet: an optimal allocation approach to influence maximization in modular social networks, pp. 1088–1094 (2010)
Wang, Y., Cong, G., Song, G., Xie, K.: Community-based greedy algorithm for mining top-k influential nodes in mobile social networks, pp. 1039–1048 (2010)
Ji, J., Huang, L., Wang, Z., Li, H., Li, S.: A new approach to maximizing the spread of influence based on community structure. J. Jilin Univ. (Science Edition) 1, 23 (2011)
Shuang, W.A.N.G., Bin, L.I., Xuejun, L.I.U., Ping, H.U.: Division of community-based influence maximization algorithm. Computer Engineering and Applications 2016(19), 8 (2016)
Shang, J., Zhou, S., Li, X., Liu, L., Hongchun, W.: Cofim: a community-based framework for influence maximization on large-scale networks. Knowl. Based Syst. 117, 88–100 (2017)
Xie, J., Szymanski, B.K., Liu, X.: SLPA: uncovering overlapping communities in social networks via a speaker-listener interaction dynamic process. In: 2011 IEEE 11th International Conference on Data Mining Workshops, pp. 344–349. IEEE (2011)
Qiu, L., Jia, W., Fan, X.: Influence maximization algorithm based on overlapping community. Data Anal. Knowl. Disc. 3(7), 94–102 (2019)
Chen, Y.-C., Zhu, W.-Y., Peng, W.-C., Lee, W.-C., Lee, S.-Y.: CIM: community-based influence maximization in social networks. ACM Trans. Intell. Syst. Technol. (TIST) 5(2), 1–31 (2014)
Huang, H., Shen, H., Meng, Z., Chang, H., He, H.: Community-based influence maximization for viral marketing. Appl. Intell. 49(6), 2137–2150 (2019). https://doi.org/10.1007/s10489-018-1387-8
Bozorgi, A., Samet, S., Kwisthout, J., Wareham, T.: Community-based influence maximization in social networks under a competitive linear threshold model. Knowl. Based Syst. 134, 149–158 (2017)
Zhu, J., Zhu, J., Ghosh, S., Weili, W., Yuan, J.: Social influence maximization in hypergraph in social networks. IEEE Trans. Netw. Sci. Eng. 6(4), 801–811 (2018)
Zhu, J., Ghosh, S., Weili, W.: Group influence maximization problem in social networks. IEEE Trans. Comput. Soc. Syst. 6(6), 1156–1164 (2019)
Rozemberczki, B., Sarkar, R.: Characteristic functions on graphs: birds of a feather, from statistical descriptors to parametric models (2020). arXiv preprint arXiv:2005.07959
Acknowledgement
The authors are supported by National Natural Science Foundation of China (No.61772005) and Natural Science Foundation of Fujian Province (No.2017J01753).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Zhong, Y., Guo, L. (2020). Group Influence Maximization in Social Networks. In: Chellappan, S., Choo, KK.R., Phan, N. (eds) Computational Data and Social Networks. CSoNet 2020. Lecture Notes in Computer Science(), vol 12575. Springer, Cham. https://doi.org/10.1007/978-3-030-66046-8_13
Download citation
DOI: https://doi.org/10.1007/978-3-030-66046-8_13
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-66045-1
Online ISBN: 978-3-030-66046-8
eBook Packages: Computer ScienceComputer Science (R0)