Skip to main content
SpringerLink
Log in

A local community detection algorithm based on internal force between nodes

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

Community structure is an important characteristic of complex networks. Uncovering communities in complex networks is currently a hot research topic in the field of network analysis. Local community detection algorithms based on seed-extension are widely used for addressing this problem because they excel in efficiency and effectiveness. Compared with global community detection methods, local methods can uncover communities without the integral structural information of complex networks. However, they still have quality and stability deficiencies in overlapping community detection. For this reason, a local community detection algorithm based on internal force between nodes is proposed. First, local degree central nodes and Jaccard coefficient are used to detect core members of communities as seeds in the network, thus guaranteeing that the selected seeds are central nodes of communities. Second, the node with maximum degree among seeds is pre-extended by the fitness function every time. Finally, the top k nodes with the best performance in pre-extension process are extended by the fitness function with internal force between nodes to obtain high-quality communities in the network. Experimental results on both real and artificial networks show that the proposed algorithm can uncover communities more accurately than all the comparison algorithms.

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
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13

Similar content being viewed by others

Notes

  1. http://networkrepository.com/index.php

References

  1. Newman M E (2001) The structure of scientific collaboration networks. Proc Natl Acad Sci 98(2):404–409

    Article  MathSciNet  Google Scholar 

  2. Newman M E (2004) Detecting community structure in networks. Eur Phys J B 38(2):321–330

    Article  Google Scholar 

  3. Girvan M, Newman M E (2002) Community structure in social and biological networks. Proc Natl Acad Sci 99(12):7821–7826

    Article  MathSciNet  Google Scholar 

  4. Fortunato S, Hric D (2016) Community detection in networks: a user guide. Phys Rep 659(2016):1–44

    Article  MathSciNet  Google Scholar 

  5. Rosvall M, Bergstrom C T (2008) Maps of random walks on complex networks reveal community structure. Proc Natl Acad Sci 105(4):1118–1123

    Article  Google Scholar 

  6. Blondel V D, Guillaume J L, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks. J Stat Mech: Theory Exper 2008(10):P10008

    Article  Google Scholar 

  7. Palla G, Derényi I, Farkas I, Vicsek T (2005) Uncovering the overlapping community structure of complex networks in nature and society. Nature 435(7043):814

    Article  Google Scholar 

  8. Sattari M, Zamanifar K (2018) A spreading activation-based label propagation algorithm for overlapping community detection in dynamic social networks. Data Knowl Eng 113:155–170

    Article  Google Scholar 

  9. Le B D, Shen H, Nguyen H, Falkner N (2018) Improved network community detection using meta-heuristic based label propagation. Appl Intell 49(4):1451–1466

    Article  Google Scholar 

  10. Biswas A, Biswas B (2017) Analyzing evolutionary optimization and community detection algorithms using regression line dominance. Inf Sci 396:185–201

    Article  Google Scholar 

  11. Fan H, Zhong Y, Zeng G (2018) Overlapping community detection based on discrete biogeography optimization. Appl Intell 48(5):1314–1326

    Google Scholar 

  12. Liu W, Yue K, Wu H, Fu X, Huang W (2017) Markov-network based latent link analysis for community detection in social behavioral interactions. Appl Intell 48(5915):1–16

    Google Scholar 

  13. Wen X, Chen W N, Lin Y, Gu T, Zhang J (2016) A maximal clique based multiobjective evolutionary algorithm for overlapping community detection. IEEE Trans Evol Comput PP(99):1–1

    Article  Google Scholar 

  14. Fortunato S (2009) Community detection in graphs. Phys Rep 486(3):75–174

    MathSciNet  Google Scholar 

  15. Whang J J, Gleich D F, Dhillon I S (2016) Overlapping community detection using neighborhood-inflated seed expansion. IEEE Trans Knowl Data Eng 28(5):1272–1284

    Article  Google Scholar 

  16. Bai L, Cheng X, Liang J, Guo Y (2017) Fast graph clustering with a new description model for community detection. Inf Sci 388:37–47

    Article  Google Scholar 

  17. Li H J, Bu Z, Li A, Liu Z, Shi Y (2016) Fast and accurate mining the community structure: integrating center locating and membership optimization. IEEE Trans Knowl Data Eng 28(9):2349–2362

    Article  Google Scholar 

  18. Lee C, Reid F, McDaid A, Hurley N (2010) Detecting highly overlapping community structure by greedy clique expansion. arXiv:1002.1827

  19. Liakos P, Ntoulas A, Delis A (2016) Scalable link community detection: A local dispersion-aware approach. In 2016 IEEE International Conference on Big Data (Big Data). IEEE, pp 716–725

  20. Kanawati R (2015) Empirical evaluation of applying ensemble methods to ego-centred community identification in complex networks. Neurocomputing 150:417–427

    Article  Google Scholar 

  21. Bai X, Yang P, Shi X (2017) An overlapping community detection algorithm based on density peaks. Neurocomputing 226:7– 15

    Article  Google Scholar 

  22. Zhi-Xiao W, Ze-chao L, Xiao-fang D, Jin-hui T (2016) Overlapping community detection based on node location analysis. Knowl-Based Syst 105:225–235

    Article  Google Scholar 

  23. Lancichinetti A, Fortunato S, Kertesz J (2009) Detecting the overlapping and hierarchical community structure in complex networks. J Phys 11(3):033015

    Google Scholar 

  24. Chen Q, Wu T T, Fang M (2013) Detecting local community structures in complex networks based on local degree central nodes. Physica A: Stat Mech Appl 392(3):529– 537

    Article  Google Scholar 

  25. Tabarzad M A, Hamzeh A (2017) A heuristic local community detection method (HLCD). Appl Intell 46 (1):62–78

    Article  Google Scholar 

  26. Hu Y, Yang B, Wong H S (2016) A weighted local view method based on observation over ground truth for community detection. Inf Sci 355:37–57

    Article  Google Scholar 

  27. Fan X, Chen Z, Cai F, Wu J, Liu S, Liao Z, Liao Z (2018) Local core members aided community structure detection. Mob Netw Appl 2017(2):1–9

    Google Scholar 

  28. Yao Y, Wu W, Lei M, Zhang X (2016) Community detection based on variable vertex influence. In 2016 IEEE First International Conference on Data Science in Cyberspace (DSC). IEEE, pp 418–423

  29. Zhang J, Ding X, Yang J (2019) Revealing the role of node similarity and community merging in community detection. Knowl-Based Syst 165:407–419

    Article  Google Scholar 

  30. Clauset A (2005) Finding local community structure in networks. Phys Rev E 72(2):026132

    Article  Google Scholar 

  31. Luo F, Wang J Z, Promislow E (2008) Exploring local community structures in large networks. Web Intell Agent Syst: Int J 6(4):387–400

    Google Scholar 

  32. Jaccard P (1901) ÉTude comparative de la distribution florale dans une portion des Alpes et des Jura. Bull Soc Vaudoise Sci Nat 37:547–579

    Google Scholar 

  33. Zachary W W (1977) An information flow model for conflict and fission in small groups. J Anthropol Res 33(4):452– 473

    Article  Google Scholar 

  34. Lusseau D, Schneider K, Boisseau O J, Haase P, Slooten E, Dawson S M (2003) The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations. Behav Ecol Sociobiol 54(4):396–405

    Article  Google Scholar 

  35. Newman M E, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev E 69(2):026113

    Article  Google Scholar 

  36. Gleiser P M, Danon L (2003) Community structure in jazz. Adv Compl Syst 6(04):565–573

    Article  Google Scholar 

  37. Adamic LA, Glance N (2005) The political blogosphere and the 2004 US election: divided they blog. Inproceedings of the 3rd international workshop on Link discovery. ACM, pp 36– 43

  38. Watts D J (1998) Collective dynamics of ’small-world’networks. Nature 393(6684):440–442

    Article  Google Scholar 

  39. Leskovec J, Kleinberg J, Faloutsos C (2007) Graph evolution: Densification and shrinking diameters. ACM Trans Knowl Discov Data (TKDD) 1(1):2

    Article  Google Scholar 

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

    Article  Google Scholar 

  41. Shao J, Han Z, Yang Q, Zhou T (2015) Community detection based on distance dynamics. Inproceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, pp 1075–1084

  42. Epasto A, Lattanzi S, Paes Leme R (2017) Ego-Splitting Framework: from Non-Overlapping to Overlapping Clusters. Inproceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, pp 145–154

  43. Hollocou A, Bonald T, Lelarge M (2018) Multiple local community detection. ACM SIGMETRICS Perform Eval Rev 45(3):76–83

    Article  Google Scholar 

  44. Coscia M, Rossetti G, Giannotti F, Pedreschi D (2012) Demon: a local-first discovery method for overlapping communities. Inproceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, pp 615–623

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

    Article  Google Scholar 

  46. Danon L, Diaz-Guilera A, Duch J, Arenas A (2005) Comparing community structure identification. J Stat Mech: Theory Exper 2005(09):P09008

    Article  Google Scholar 

Download references

Acknowledgements

This work is partly supported by the National Natural Science Foundation of China under Grant No. 61300104, No. 61300103 and No. 61672159, the Fujian Province High School Science Fund for Distinguished Young Scholars under Grant No. JA12016, the Fujian Natural Science Funds for Distinguished Young Scholar under Grant No. 2015J06014, the Fujian Industry-Academy Cooperation Project under Grant No. 2018H6010 and No. 2017H6008, and Haixi Government Big Data Application Cooperative Innovation Center.

Author information

Authors and Affiliations

  1. College of Mathematics and Computer Science, Fuzhou University, Fuzhou, 350108, China

    Kun Guo, Ling He, Yuzhong Chen & Wenzhong Guo

  2. Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing, Fuzhou, 350108, China

    Kun Guo, Ling He, Yuzhong Chen & Wenzhong Guo

  3. Key Laboratory of Spatial Data Mining and Information Sharing, Ministry of Education, Fuzhou, 350108, China

    Kun Guo, Ling He, Yuzhong Chen & Wenzhong Guo

  4. Power Science and Technology Corporation State Grid Information and Telecommunication Group, Fuzhou, 351008, China

    Jianning Zheng

Authors
  1. Kun Guo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ling He
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yuzhong Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Wenzhong Guo
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Jianning Zheng
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wenzhong Guo.

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

Guo, K., He, L., Chen, Y. et al. A local community detection algorithm based on internal force between nodes. Appl Intell 50, 328–340 (2020). https://doi.org/10.1007/s10489-019-01541-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-019-01541-1

Keywords

Search

Navigation