Skip to main content

Detecting Hierarchical and Overlapping Community Structures in Social Networks Using a One-Stage Memetic Algorithm

  • Conference paper
  • First Online:

Abstract

Detection of hierarchical and overlapping community structures for social networks is crucial in social network analysis. Previous strategies were focused on a two-stage strategy for separately detecting hierarchical and overlapping community structures. This paper develops a one-stage memetic algorithm for concurrently detecting hierarchical and overlapping community structures in social networks, where quality evaluation functions, community capacity, and hierarchical levels are taken into account to increase the solution quality. This algorithm includes a local search scheme to improve the solution searching ability. Through simulation, this algorithm shows pleasing quality.

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

  2. Ahn, Y.Y., Bagrow, J.P., Lehmann, S.: Link communities reveal multiscale complexity in networks. Nature 466(7307), 761–764 (2010)

    Article  Google Scholar 

  3. Cai, Y., Shi, C., Dong, Y., Ke, Q., Wu, B.: A novel genetic algorithm for overlapping community detection. In: Tang, J., King, I., Chen, L., Wang, J. (eds.) ADMA 2011. LNCS (LNAI), vol. 7120, pp. 97–108. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-25853-4_8

    Chapter  Google Scholar 

  4. Leskovec, J., Lang, K.J., Mahoney, M.: Empirical comparison of algorithms for network community detection. In: Proceedings of the 19th International World Wide Web Conference (WWW 2010), pp. 631–640 (2010)

    Google Scholar 

  5. Chen, J., Saad, Y.: Dense subgraph extraction with application to community detection. IEEE Trans. Knowl. Data Eng. 24(7), 1216–1230 (2012)

    Article  Google Scholar 

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

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Der-Jiunn Deng .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Lin, CC., Deng, DJ., Wu, JC., Lu, LY. (2018). Detecting Hierarchical and Overlapping Community Structures in Social Networks Using a One-Stage Memetic Algorithm. In: Li, B., Shu, L., Zeng, D. (eds) Communications and Networking. ChinaCom 2017. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 237. Springer, Cham. https://doi.org/10.1007/978-3-319-78139-6_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-78139-6_19

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-78138-9

  • Online ISBN: 978-3-319-78139-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics