Skip to main content

Overlapping Community Discovery Algorithm Based on Three-Level Neighbor Node Influence

  • Conference paper
  • First Online:
Machine Learning for Cyber Security (ML4CS 2022)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13656))

Included in the following conference series:

  • 797 Accesses

Abstract

In view of the high time complexity of the current overlapping community discovery algorithm and the low stability, an overlapping community discovery algorithm OCDITN based on three-level neighbor influence is proposed. The algorithm uses three-level neighbor node influence measurement method TIM (Three-level Influence Measurement) to calculate the node influence, and determines the order of selecting and updating nodes according to the node influence; the similarity between the nodes is determined by the update sequence of neighbor node labels, and finally the label membership of each node is calculated to discover the overlapping communities. The experiment is performed based on the artificial simulation network data set and the real world network data set. Compared with the SLPA, LPANNI, and COPRA algorithms, the performance of this algorithm is improved by 7% and 12% on the two evaluation standards EQ and Qvo respectively.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Shen Hao, A., Rong Huan, Y.: Review of complex network theory. Comput. Syst. Appl. 29(09), 26–31 (2020)

    Google Scholar 

  2. Schmitt, R., Ramos, P., Santiago, R., et al.: Novel Clique enumeration heuristic for detecting overlapping clusters. In: IEEE Congress on Evolutionary Computation, pp. 1390–1397. IEEE (2017)

    Google Scholar 

  3. Zhou, B.: Applying the Clique Percolation Method to analyzing cross-market branch banking network structure: the case of Illinois. Soc. Netw. Anal. Min. 6(1), 1–14 (2016). https://doi.org/10.1007/s13278-016-0318-0

    Article  Google Scholar 

  4. Lancichinetti, A., Fortunato, S., Kertész, J.: Detecting the overlapping and hierarchical community structure in complex networks. New J. Phys. 11(3), 033015 (2009)

    Article  Google Scholar 

  5. Hu, L., Guo, G., Ma, C.: Overlapping community discovery method based on symmetric nonnegative matrix factorization. Comput. Appl. 35(10), 2742–2746 (2015)

    Google Scholar 

  6. Wang, B., Li, Q., Sheng, J., Sun, Z.: Overlapping community discovery algorithm for linear flow based on edge graph. Comput. Eng. Appl. 55(02), 60–66 (2019)

    Google Scholar 

  7. Gregory, S.: Finding overlapping communities in networks by label propagation. New J. Phys. 12(10), 103018 (2010)

    Article  MATH  Google Scholar 

  8. 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)

    Google Scholar 

  9. Lu, M., Zhang, Z., Qu, Z., Kang, Y.: LPANNI: overlapping community detection using label propagation in large-scale complex networks. IEEE Trans. Knowl. Data Eng. 31(9), 1736–1749 (2018)

    Article  Google Scholar 

  10. Sun, H., Liu, J., Huang, J., Wang, G., Jia, X., Song, Q.: LinkLPA: a link-based label propagation algorithm for overlapping community detection in networks. Comput. Intell. 33(2), 308–331 (2017)

    Article  MathSciNet  Google Scholar 

  11. Shuxin, Y., Wen, L., Kaili, Z.: Measurement method of node influence in complex networks based on three-level neighbors. Acta Electron. Sin. 42(05), 1140–1148 (2020)

    Google Scholar 

  12. Shen, H., Cheng, X., Cai, K., Hu, M.B.: Detect overlapping and hierarchical community structure in networks. Phys. A Stat. Mech. Appl. 388(8), 1706–1712 (2009)

    Article  Google Scholar 

  13. Nicosia, V., Mangioni, G., Carchiolo, V., Malgeri, M.: Extending the definition of modularity to directed graphs with overlapping communities. J. Stat. Mech. Theory Exp. 2009(03), P03024 (2009)

    Article  Google Scholar 

  14. Lancichinetti, A., Fortunato, S., Radicchi, F.: Benchmark graphs for testing community detection algorithms. Phys. Rev. E 78(4), 046110 (2008)

    Article  Google Scholar 

Download references

Acknowledgment

This study was funded by Guangdong Natural Science Fund Project (2021A1515011243), Guangzhou Science and Technology Plan Project (201902020016), Yunfu Science and Technology Plan Project S2021010104 and Guangdong Science and Technology Plan Project (2019B010139001, 2021B1212100004).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Wenchao Jiang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Chen, S., Huang, G., Lin, S., Jiang, W., Zhao, Z. (2023). Overlapping Community Discovery Algorithm Based on Three-Level Neighbor Node Influence. In: Xu, Y., Yan, H., Teng, H., Cai, J., Li, J. (eds) Machine Learning for Cyber Security. ML4CS 2022. Lecture Notes in Computer Science, vol 13656. Springer, Cham. https://doi.org/10.1007/978-3-031-20099-1_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-20099-1_28

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-20098-4

  • Online ISBN: 978-3-031-20099-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics