Skip to main content
SpringerLink
Log in

Influence maximization based on community structure and second-hop neighborhoods

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

With the spread of Internet and big data research and applications, influence propagation in networks becomes one of the hot topics in the field of social network analysis in recent years. Influence Maximization (IM), which selects a set of k seeds from a network to maximize the expected number of influenced nodes, has been extensively studied due to its immense application potential and enormous technical challenges. In this paper, we present a new heuristic method named IMCAN (I nfluence M aximization based on C ommunity A nd Second-hop N eighbors), which makes utilization of community structure to select the seed nodes. We employ two efficient community detection algorithms, FastQ and LPA, to extract multiple community structures first, then calculate an influence score for each node by considering the average number of its adjacent communities and its influences among its first- and second-order neighbors. After that, we select the node with the largest influence score as a seed, remove its direct neighbors from the candidate set, attenuate its second-order neighbors’ influence scores, and then choose the node with the largest influence score as the next seed. This procedure is repeated until all the k seeds are selected. The experiments on some real-world networks show that IMCAN can extract the seeds with the larger propagation abilities from networks, it outperforms the comparison algorithms significantly.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

Notes

  1. https://investor.fb.com/investor-events/event-details/2021/Facebook-Q4-2020-Earnings-/default.aspx

  2. https://finance.sina.com.cn/stock/usstock/c/2021-03-18/doc-ikkntiam4887520.shtm

References

  1. Domingos P, Richardson M (2001) Mining the network value of customers. In: Proceedings of the seventh ACM SIGKDD international conference on knowledge discovery and data mining. ACM, pp 57–66

  2. Chen S, Fan J, Li G, Feng J, Tan K.l (2015) Online Topic-Aware Influence Maximization. J. Tang, Proc. VLDB Endow. 8(6):666–677. 10.14778/2735703.2735706

    Article  Google Scholar 

  3. Dong J, Ye F, Chen W, Wu J (2018) Identifying Influential Nodes in Complex Networks via Semi-Local Centrality. In: 2018 IEEE International Symposium on Circuits and Systems (ISCAS). pp 1–5

  4. Guille A, Hacid H, Favre C, Zighed DA (2013) Information diffusion in online social networks: A survey. ACM Sigmod Record 42(2):17

    Article  Google Scholar 

  5. Bovet A, Makse HA (2019) Influence of fake news in Twitter during the 2016 US presidential election. Nat. Commun. 10(1):7. https://doi.org/10.1038/s41467-018-07761-2

    Article  Google Scholar 

  6. Kempe D, Kleinberg J, Tardos É (2003) Maximizing the spread of influence through a social network. In: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, pp 137–146

  7. Leskovec J, Krause A, Guestrin C, Faloutsos C, Faloutsos C, VanBriesen J, Glance N (2007) Cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, pp 420–429

  8. Ye M, Liu X, Lee WC (2012) Exploring social influence for recommendation: a generative model approach. In: Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval. ACM, pp 671–680

  9. Nian F, Hu C, Yao S, Wang L, Wang X (2018) An immunization based on node activity. Chaos, Solitons & Fractals 107:228. https://doi.org/10.1016/j.chaos.2018.01.013. https://www.sciencedirect.com/science/article/pii/S0960077918300134

    Article  MathSciNet  Google Scholar 

  10. Nian F, Wang X (2010) Efficient immunization strategies on complex networks. https://doi.org/10.1016/j.jtbi.2010.01.007https://doi.org/10.1016/j. https://doi.org/10.1016/j.jtbi.2010.01.007jtbi.2010.01.007. https://www.sciencedirect.com/science/article/pii/S0022519310000111, vol 1, p 77

  11. Budak C, Agrawal D, El Abbadi A (2011) Limiting the spread of misinformation in social networks. In: Proceedings of the 20th international conference on World wide web. ACM, pp 665–674

  12. He X, Song G, Chen W, Jiang Q (2012) Influence blocking maximization in social networks under the competitive linear threshold model. In: Proceedings of the 2012 siam international conference on data mining. SIAM, pp 463–474

  13. Huo Z, Huang X, Hu X (2018) Link Prediction With Personalized Social Influence. In: McIlraith SA, Weinberger KQ (eds) Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence,. (AAAI-18), the 30th innovative Applications of Artificial Intelligence (IAAI-18), and the 8th AAAI Symposium on Educational Advances in Artificial Intelligence (EAAI-18), New Orleans, Louisiana, USA, February 2-7, pp 2289–2296. (AAAI Press, 2018) https://www.aaai.org/ocs/index.php/AAAI/AAAI18/paper/view/16971

  14. Vega-Oliveros DA, Zhao L, Berton L (2019) Evaluating link prediction by diffusion processes in dynamic networks. Sci. Rep. 9(1):10833. https://doi.org/10.1038/s41598-019-47271-9

    Article  Google Scholar 

  15. Cui Y, Wang X, Li J (2014) Detecting overlapping communities in networks using the maximal sub-graph and the clustering coefficient. Physica A: Statistical Mechanics and its Applications 405:85. https://doi.org/10.1016/j.physa.2014.03.027https://doi.org/10.1016/j.physa.2014. https://doi.org/10.1016/j.physa.2014.03.02703.027. https://www.sciencedirect.com/science/article/pii/S0378437114002222https://www.sciencedirect.com/science/article/pii/S03784 https://www.sciencedirect.com/science/article/pii/S037843711400222237114002222

    Article  Google Scholar 

  16. Wang X, Li J (2013) Detecting communities by the core-vertex and intimate degree in complex networks. Physica A: Statistical Mechanics and its Applications, 392 10:2555. https://doi.org/10.1016/j.physa.2013.01.039. https://www.sciencedirect.com/science/article/pii/S0378437113000915

    Article  Google Scholar 

  17. Li J, Wang X, Eustace J (2013) Detecting overlapping communities by seed community in weighted complex networks. Physica A: Statistical Mechanics and its Applications 392(23):6125. https://doi.org/10.1016/j.physa.2013.07.066https://doi.org/10.1016/j.phy- https://doi.org/10.1016/j.physa.2013.07.066sa.2013.07.066. https://www.sciencedirect.com/science/article/pii/S0378437113006973https://www.sciencedirect.com/science/article/pii/ https://www.sciencedirect.com/science/article/pii/S0378437113006973S0378437113006973

    Article  Google Scholar 

  18. Shi W, Wang CD, Lai JH (2017) Community detection based on influence power. Applied Informatics 4(1):8. https://doi.org/10.1186/s40535-017-0037-2

    Article  Google Scholar 

  19. Saito K, Kimura M, Ohara K, Motoda H (2012) Efficient discovery of influential nodes for SIS models in social networks. Knowl. Inf. Syst. 30(3):613. https://doi.org/10.1007/s10115-011-0396-2

    Article  Google Scholar 

  20. Wen S, Haghighi MS, Chen C, Xiang Y, Zhou W, Jia W (2015) A Sword with Two Edges: Propagation Studies on Both Positive and Negative Information in Online Social Networks. IEEE Trans. Comput. 64(3):640

    Article  MathSciNet  Google Scholar 

  21. Wang X, Zhao T (2017) Model for multi-messages spreading over complex networks considering the relationship between messages. Communications in Nonlinear Science and Numerical Simulation 48:63. https://doi.org/10.1016/j.cnsns.2016.12.019https://doi.org/10.1016/j. https://doi.org/10.1016/j.cnsns.2016.12.019cnsns.2016.12.019. https://www.sciencedirect.com/science/article/pii/S1007570416305135https://www.sciencedirect.com/science/article/ https://www.sciencedirect.com/science/article/pii/S1007570416305135pii/S1007570416305135

    Article  Google Scholar 

  22. Chen W, Wang C, Wang Y (2010) Scalable Influence Maximization for Prevalent Viral Marketing in Large-Scale Social Networks. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD ’10. Association for Computing Machinery, New York, NY, USA, pp 1029–1038. https://doi.org/10.1145/1835804.1835934

  23. Li D, Wang X, Huang P (2017) A fractal growth model: Exploring the connection pattern of hubs in complex networks. Physica A: Statistical Mechanics and its Applications 471:200. https://doi.org/10.1016/j.physa.2016.12.038https://doi.org/10.1016/j.physa.20 https://doi.org/10.1016/j.physa.2016.12.03816.12.038. https://www.sciencedirect.com/science/article/pii/S0378437116310184https://www.sciencedirect.com/science/article/pii/S03 https://www.sciencedirect.com/science/article/pii/S037843711631018478437116310184

    Article  Google Scholar 

  24. Li Y, Chen W, Wang Y, Zhang ZL (2013) Influence Diffusion Dynamics and Influence Maximization in Social Networks with Friend and Foe Relationships. In: Proceedings of the Sixth ACM International Conference on Web Search and Data Mining, WSDM ’13. Association for Computing Machinery, New York, NY, USA, pp 657–666. https://doi.org/10.1145/2433396.2433478

  25. Liu B, Cong G, Xu D, Zeng Y (2012) Time Constrained Influence Maximization in Social Networks. In: 2012 IEEE 12th International Conference on Data Mining. pp 439–448

  26. Li Y, Fan J, Wang Y, Tan K (2018) Influence Maximization on Social Graphs: A Survey. IEEE Trans. Knowl. Data Eng. 30(10):1852

    Article  Google Scholar 

  27. S. N., A. B., Bhattacharya S (2018) Influence maximization in large social networks: Heuristics, models and parameters. Future Generation Computer Systems 89:777. https://doi.org/10.1016/j.future.2018.07.015. http://www.sciencedirect.com/science/article/pii/S0167739X18301092

    Article  Google Scholar 

  28. Goyal A, Lu W, Lakshmanan LV (2011) Celf++: optimizing the greedy algorithm for influence maximization in social networks. In: Proceedings of the 20th international conference companion on World wide web. ACM, pp 47–48

  29. Zhou C, Zhang P, Zang W, Guo L (2015) On the Upper Bounds of Spread for Greedy Algorithms in Social Network Influence Maximization. IEEE Trans. Knowl. Data Eng. 27(10): 2770

    Article  Google Scholar 

  30. Chen W, Wang Y, Yang S (2009) Efficient influence maximization in social networks. In: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, pp 199–208

  31. Cheng S, Shen H, Huang J, Zhang G, Cheng X (2013) StaticGreedy: Solving the Scalability-Accuracy Dilemma in Influence Maximization. In: Proceedings of the 22nd ACM International Conference on Information & Knowledge Management, CIKM ’13. Association for Computing Machinery, New York, NY, USA, pp 509–518. https://doi.org/10.1145/2505515.2505541

  32. Wang Y, Cong G, Song G, Xie K (2010) 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, KDD ’10. Association for Computing Machinery, New York, NY, USA, pp 1039–1048. https://doi.org/10.1145/1835804.1835935

  33. Raghavan UN, Albert R, Kumara S (2007) Near linear time algorithm to detect community structures in large-scale networks. Phys. Rev. E 76:036106. https://doi.org/10.1103/PhysRevE.76.036106

    Article  Google Scholar 

  34. Ye F, Liu J, Chen C, Ling G, Zheng Z, Zhou Y (2018) Identifying Influential Individuals on Large-Scale Social Networks: A Community Based Approach. IEEE Access 6:47240

    Article  Google Scholar 

  35. Tang J, Qu M, Wang M, Zhang M, Yan J, Mei Q (2015) LINE: Large-Scale Information Network Embedding. In: Proceedings of the 24th International Conference on World Wide Web, WWW ’15. International World Wide Web Conferences Steering Committee, Republic and Canton of Geneva, CHE, pp 1067–1077. https://doi.org/10.1145/2736277.2741093

  36. Borgs C, Brautbar M, Chayes J, Lucier B (2014) Maximizing social influence in nearly optimal time. In: Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms. SIAM, pp 946–957

  37. Tang Y, Xiao X, Shi Y (2014) Influence maximization: Near-optimal time complexity meets practical efficiency. In: Proceedings of the 2014 ACM SIGMOD international conference on Management of data. ACM, pp 75–86

  38. Tang Y, Shi Y, Xiao X (2015) Influence maximization in near-linear time: A martingale approach. In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data. ACM, pp 1539–1554

  39. Nguyen DL, Nguyen TH, Do TH, Yoo M (2017) Probability-based multi-hop diffusion method for influence maximization in social networks. Wirel. Pers. Commun. 93(4):903

    Article  Google Scholar 

  40. Page L, Brin S, Motwani R, Winograd T (1999) The pagerank citation ranking: Bringing order to the web. Technical Report 1999-66, Stanford InfoLab. http://ilpubs.stanford.edu:8090/422/. Previous number = SIDL-WP-1999-0120

  41. Qiu L, Sai S, Tian X (2021) TsFSIM: a three-step fast selection algorithm for influence maximisation in social network. Connection Science 0(0):1. https://doi.org/10.1080/09540091.2021.1904206

    Google Scholar 

  42. Shang J, Zhou S, Li X, Liu L, Wu H (2017) CoFIM: A community-based framework for influence maximization on large-scale networks. Knowl.-Based Syst. 117:88

    Article  Google Scholar 

  43. Jalayer M, Azheian M, M.A.M.A (2018) A hybrid algorithm based on community detection and multi attribute decision making for influence maximization. Kermani, Computers & Industrial Engineering 120:234

    Article  Google Scholar 

  44. Huang H, Shen H, Meng Z, Chang H, He H (2019) Community-based influence maximization for viral marketing. Appl. Intell. 49(6):2137. https://doi.org/10.1007/s10489-018-1387-8

    Article  Google Scholar 

  45. Kumar S, Singhla L, Jindal K, Grover K, Panda BS (2021) IM-ELPR: Influence maximization in social networks using label propagation based community structure. Applied Intelligence, https://doi.org/10.1007/s10489-021-02266-w

  46. Samir AM, Rady S, Gharib TF (2021) LKG: A fast scalable community-based approach for influence maximization problem in social networks. Physica A: Statistical Mechanics and its Applications 582:126258. https://doi.org/10.1016/j.physa.2021.126258https://doi.org/10.10 https://doi.org/10.1016/j.physa.2021.12625816/j.physa.2021.126258. https://www.sciencedirect.com/science/article/pii/S0378437121005318

    Article  Google Scholar 

  47. Blondel VD, Guillaume JL, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks. Journal of statistical mechanics: theory and experiment 2008(10):P10008

    Article  Google Scholar 

  48. Fortunato S, Barthélemy M (2007) Resolution limit in community detection. Proceedings of the National Academy of Sciences 104(1):36. https://doi.org/10.1073/pnas.0605965104https://doi.org/10.1073/pnas. https://doi.org/10.1073/pnas.06059651040605965104. https://www.pnas.org/content/104/1/36

    Article  Google Scholar 

  49. Newman ME (2004) Fast algorithm for detecting community structure in networks, vol 69, p 2004

  50. Newman ME, Girvan M (2004) Finding and evaluating community structure in networks, vol 69, p 2004

  51. Batagelj V, Mrvar A (2006) Pajek datasets. http://vlado.fmf.uni-lj.si/pub/networks/data/

  52. Guimerà R, Danon L, Díaz-Guilera A, Giralt F, Arenas A (2003) Self-similar community structure in a network of human interactions. Phys. Rev. E 68:065103. https://doi.org/10.1103/PhysRevE.68.065103

    Article  Google Scholar 

  53. Rozemberczki B, Allen C, Sarkar R (2021) Multi-Scale Attributed Node Embedding. Journal of Complex Networks 9:2

    Article  MathSciNet  Google Scholar 

  54. Boguñá M, Pastor-Satorras R, Díaz-Guilera A, Arenas A (2004) Models of social networks based on social distance attachment. Phys. Rev. E 70:056122. https://doi.org/10.1103/PhysRevE.70.056122https://doi.org/10.1103/PhysRevE.70.05 https://doi.org/10.1103/PhysRevE.70.0561226122

    Article  Google Scholar 

  55. Rozemberczki B, Davies R, Sarkar R, Sutton C (2019) GEMSEC: Graph Embedding with Self Clustering. In: Proceedings of the 2019 IEEE/ACM international conference on advances in social networks analysis and mining 2019. ACM, pp 65–72

  56. Yang J, Leskovec J (2012) Defining and Evaluating Network Communities Based on Ground-Truth. In: 2013 IEEE 13th international conference on data mining. IEEE Computer Society, Los Alamitos, pp 745–754. https://doi.org/10.1109/ICDM.2012.138

Download references

Acknowledgements

This work was partially supported by the Natural Science Foundation of Gansu Province of China (Grant No. 20JR5RA284).

Author information

Authors and Affiliations

  1. School of Information Science and Engineering, Lanzhou University, Lanzhou, 730000, China

    Jianjun Cheng, Ke Yang, Zeyi Yang, Handong Zhang, Wenbo Zhang & Xiaoyun Chen

Authors
  1. Jianjun Cheng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ke Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zeyi Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Handong Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Wenbo Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Xiaoyun Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jianjun Cheng.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Cheng, J., Yang, K., Yang, Z. et al. Influence maximization based on community structure and second-hop neighborhoods. Appl Intell 52, 10829–10844 (2022). https://doi.org/10.1007/s10489-021-02880-8

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-021-02880-8

Keywords

Search

Navigation