Skip to main content
SpringerLink
Log in

Maximizing Group Coverage in Social Networks

  • Conference paper
  • First Online:
Parallel and Distributed Computing, Applications and Technologies (PDCAT 2020)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 12606))

Abstract

Groups play a crucial role in decision-making of social networks, since individual decision-making is often influenced by groups. This brings the Group Influence Maximization (GIM) problem which aims to maximize the expected number of activated groups by finding k seed nodes. The GIM problem has been proved NP-hard while computing the objective function is \(\#P\)-hard under Independent Cascade (IC) model. We propose an algorithm called Maximizing Group Coverage (MGC) which greedily selects the best node based on evaluating the contribution of nodes to the groups, ensuring the success of approximating the maximization of the number of activated groups. Finally, we compare the MGC algorithm with the baseline algorithm called Maximum Coverage (MC) through experiments, demonstrating that MGC outperforms MC under IC model regarding the average number of activated groups.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Pedro, D., Matt, R.: Mining the network value of customers. In: Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 57–66 (2001)

    Google Scholar 

  2. Pablo, A.E., Pablo, V., Kazumi, S.: Selecting the most influential nodes in social networks. In: 2007 International Joint Conference on Neural Networks, pp. 2397–2402. IEEE (2007)

    Google Scholar 

  3. Wei, C., Yajun, W., Siyu, Y.: Efficient influence maximization in social networks. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 199–208 (2009)

    Google Scholar 

  4. Wei, C., Yifei, Y., Li, Z.: Scalable influence maximization in social networks under the linear threshold model. In 2010 IEEE International Conference on Data Mining, pp. 88–97. IEEE (2010)

    Google Scholar 

  5. Amit, G., Wei, L., Laks, V.S.L.: Simpath: an efficient algorithm for influence maximization under the linear threshold model. In: 2011 IEEE 11th International Conference on Data Mining, pp. 211–220. IEEE (2011)

    Google Scholar 

  6. Guo-Liang, L., Ya-Ping, C., Jian-Hua, F., Yao-Qiang, X.: Influence maximization on multiple social networks. Chinese J. Comput. 39(4), 643–656 (2016)

    Google Scholar 

  7. David, K., Jon, K., Éva, T.: Maximizing the spread of influence through a social network. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 137–146 (2003)

    Google Scholar 

  8. Jure, L., Andreas, K., Carlos, G., Christos, F., Jeanne, V., Natalie, G.: Cost-effective outbreak detection in networks. In Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 420–429 (2007)

    Google Scholar 

  9. Amit, G., Wei, L., Laks, V.S.L.: Celf++ optimizing the greedy algorithm for influence maximization in social networks. In Proceedings of the 20th International Conference Companion on World Wide Web, pp. 47–48 (2011)

    Google Scholar 

  10. Christian, B., Michael, B., Jennifer, C., Brendan, L.: Maximizing social influence in nearly optimal time. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 946–957. SIAM (2014)

    Google Scholar 

  11. Youze, T., Xiaokui, X., Yanchen, S.: Influence maximization: near-optimal time complexity meets practical efficiency. In: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, pp. 75–86 (2014)

    Google Scholar 

  12. Youze, T., Yanchen, S., Xiaokui, X.: Influence maximization in near-linear time: a martingale approach. In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, pp. 1539–1554 (2015)

    Google Scholar 

  13. Hung, T.N., My, T.T., Thang, N.D.: Stop-and-stare: optimal sampling algorithms for viral marketing in billion-scale networks. In: Proceedings of the 2016 International Conference on Management of Data, pp. 695–710 (2016)

    Google Scholar 

  14. Tianyu, C., Xindong, W., Song, W., Xiaohua, H.: Oasnet: an optimal allocation approach to influence maximization in modular social networks. In: Proceedings of the 2010 ACM Symposium on Applied Computing, pp. 1088–1094 (2010)

    Google Scholar 

  15. Yu, W., Gao, C., Guojie, S., Kunqing, X.: Community-based greedy algorithm for mining top-k influential nodes in mobile social networks. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1039–1048 (2010)

    Google Scholar 

  16. Jin-chao, J., Lan, H., Zhe, W., Hong-ming, L., San-yi, L.: A new approach to maximizing the spread of influence based on community structure. J. Jilin University (Science Edition), 1, 23 (2011)

    Google Scholar 

  17. 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

    Article  Google Scholar 

  18. Bozorgi, A., Samet, S., Kwisthout, J., Wareham, T.: Community-based influence maximization in social networks under a competitive linear threshold model. Knowledge-Based Syst. 134, 149–158 (2017)

    Article  Google Scholar 

  19. Zhu, J., Ghosh, S., Weili, W.: Group influence maximization problem in social networks. IEEE Trans. Comput. Soc. Syst. 6(6), 1156–1164 (2019)

    Article  Google Scholar 

  20. Schoenebeck, G., Tao, B.: Beyond worst-case (in) approximability of nonsubmodular influence maximization. ACM Trans. Comput. Theory (TOCT) 11(3), 1–56 (2019)

    Article  MathSciNet  Google Scholar 

  21. Francis, B., et al.: Learning with submodular functions: a convex optimization perspective. Found. Trends® Machine Learn. 6(2–3), 145–373 (2013)

    Google Scholar 

  22. Wei, L., Wei, C., Laks, V.S.L.: From competition to complementarity: comparative influence diffusion and maximization. Proc. VLDB Endowment, 9(2), 60–71 (2015)

    Google Scholar 

  23. Benedek, R., Rik, S.: Characteristic functions on graphs: birds of a feather, from statistical descriptors to parametric models. In: The 29th ACM Conference on Information and Knowledge Management, abs/2005.07959 (2020)

    Google Scholar 

Download references

Acknowledgements

The first and the second author are supported by Natural Science Foundation of China (No. 61772005). The third author is supported by Natural Science Foundation of Fujian Province (No. 2020J01845) and Educational Research Project for Young and Middle-aged Teachers of Fujian Provincial Department of Education (No. JAT190613).

Author information

Authors and Affiliations

  1. College of Mathematics and Computer Science, Fuzhou University, Fuzhou, 350116, People’s Republic of China

    Yuting Zhong & Longkun Guo

  2. School of Computer Science, Qilu University of Technology (Shandong Academy of Sciences), Jinan, 250353, People’s Republic of China

    Longkun Guo

  3. College of Mathematics and Data Science, Minjiang University, Fuzhou, 350108, China

    Peihuang Huang

Authors
  1. Yuting Zhong
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Longkun Guo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Peihuang Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Peihuang Huang .

Editor information

Editors and Affiliations

  1. Shenzhen Institutes of Advanced Technology, Shenzhen, China

    Yong Zhang

  2. Shenzhen Institutes of Advanced Technology, Shenzhen, China

    Yicheng Xu

  3. Griffith University, Gold Coast, QLD, Australia

    Hui Tian

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zhong, Y., Guo, L., Huang, P. (2021). Maximizing Group Coverage in Social Networks. In: Zhang, Y., Xu, Y., Tian, H. (eds) Parallel and Distributed Computing, Applications and Technologies. PDCAT 2020. Lecture Notes in Computer Science(), vol 12606. Springer, Cham. https://doi.org/10.1007/978-3-030-69244-5_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-69244-5_24

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-69243-8

  • Online ISBN: 978-3-030-69244-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation