Skip to main content

An Ant Colony Random Walk Algorithm for Overlapping Community Detection

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 10585))

Abstract

Discovery of communities is a very effective way to understand the properties of complex networks. An improved ant colony algorithm based on random walk has been proposed in this paper. Inspired by the framework proposed in AntCBO, firstly, a list of node importance is obtained through calculation. The nodes in the network will be sorted in descending order of importance. Secondly, on the basis of random walk, a matrix is constructed to measure the similarity of nodes and we can use this matrix and pheromone to get the heuristic information. Thirdly, an improved ant’s location discovery strategy is proposed. After the movement of ants, every node will keep a list of labels and the proposed post processing will give the result of overlapping community detection. Finally, a test in real-world networks is given. The result shows that this algorithm has better performance than existing methods in finding overlapping community structure.

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

Buying options

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

Learn about institutional subscriptions

References

  1. Barabási, A.L., Crandall, R.E.: The new science of networks. Phys. Today 6(5), 243–270 (2003)

    Google Scholar 

  2. Newman, M.E.J.: The structure and function of complex networks. Siam Rev. 45(2), 167–256 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  3. Lancichinetti, A., Fortunato, S., Kertész, J.: Detecting the overlapping and hierarchical community structure of complex networks. New J. Phys. 11(3), 19–44 (2008)

    Google Scholar 

  4. Gregory, S.: Finding overlapping communities in networks by label propagation. New J. Phys. 12(10), 2011–2024 (2009)

    Google Scholar 

  5. Xie, J., Szymanski, B.K., Liu, X.: SLPA: uncovering overlapping communities in social networks via a speaker-listener interaction dynamic process. In: IEEE, International Conference on Data Mining Workshops IEEE Computer Society, pp. 344–349 (2011)

    Google Scholar 

  6. Sun, H., et al.: LinkLPA: a link-based label propagation algorithm for overlapping community detection in networks. Comput. Intell. (2016)

    Google Scholar 

  7. Zhou, X., et al.: An ant colony based algorithm for overlapping community detection in complex networks. Phys. A Stat. Mech. Appl. 427, 289–301 (2015)

    Article  Google Scholar 

  8. Zhang, X.K., et al.: An improved label propagation algorithm based on the similarity matrix using random walk. Int. J. Mod. Phys. B 30(16), 1650093 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  9. Brin, S., Page, L.: Reprint of: the anatomy of a large-scale hypertextual web search engine. Comput. Netw. 56(18), 3825–3833 (2012)

    Article  Google Scholar 

  10. Liu, D.: Methods of community detection in complex networks and their responses to perturbations. Dissertation. Tianjin University (2013). In Chinese

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zhengyou Xia .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Ma, T., Xia, Z., Yang, F. (2017). An Ant Colony Random Walk Algorithm for Overlapping Community Detection. In: Yin, H., et al. Intelligent Data Engineering and Automated Learning – IDEAL 2017. IDEAL 2017. Lecture Notes in Computer Science(), vol 10585. Springer, Cham. https://doi.org/10.1007/978-3-319-68935-7_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-68935-7_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-68934-0

  • Online ISBN: 978-3-319-68935-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics