Skip to main content

An Empirical Study on Community Detection Algorithms

  • Conference paper
  • First Online:
Book cover Smart Intelligent Computing and Applications

Part of the book series: Smart Innovation, Systems and Technologies ((SIST,volume 104))

  • 1020 Accesses

Abstract

Social networks are simply networks of social interactions and personal relationships. They have several properties, and community is one among them. These communities can be arranged by individuals in such a way that within the group they can connect more frequently compared to the outside of the group. Community detection can discover groups within a network where individuals’ group memberships are not explicitly given. These networks are represented in the form of graph. When graph size is increased then the number of communities will also be increased. Because of this complexity and dynamic nature of the graph, community detection in social network becomes a challenging task. Hence, more research is going on community detection, resulting in plenty of algorithms that come into picture to find effective way of detecting communities in a graph. In this paper, authors have presented different community detection algorithms and also discussed their pros and cons. Finally, authors stated some of the research challenges in this area.

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 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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. Blondel, V.D., Guillaume, J.-L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities In large networks. J. Stat. Mech. Theory Exp. 1742–5468 (2008)

    Google Scholar 

  2. Rotta, R., Noack, A.: Multilevel local search algorithms for modularity clustering. J. Exp. Algorithms, vol. 16, Article no 2.3 (2011). DOI=http://doi.acm.org/10.1145/1963190.1970376

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

    Article  Google Scholar 

  4. Fortunato, S.: Community detection in graphs. Phys. Rep. 486(3–5), 75–174 (2010). https://doi.org/10.1016/j.phyrep.2009.11.002(2010)

    Article  MathSciNet  Google Scholar 

  5. ElBarawy, Y.M., Mohamedt, R.F., Ghali, N.I.: Improving social network community detection using DBSCAN algorithm. In: Computer Applications and Research (WSCAR), 2014 World Symposium, (2014). IEEE

    Google Scholar 

  6. Mehjabin, et al.: Community detection methods in social networs. In: I.J. Education and managementenigineering, 2015,1,8–18 (2015) (http://www.mecs-press.net), https://doi.org/10.5815/ijeme

  7. Chakraborty, S., Nagwani, N., Dey, L.: Performance comparison of incremental K-means and incremental DBSCAN algorithms. Int. J. Comput. Appl. 27, 14–18 (2011)

    Google Scholar 

  8. Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. U.S.A. 99, 7821–7826 (2002)

    Article  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  10. Gergely, T.: Criterions for locally dense subgraphs. In: arXiv:1103.3397 [physics.soc-ph] (2011)

  11. Mohamed Nasr, M. et al.: A proposed algorithm to detect the largest community based on depth level. Int. J. Adv. Netw. Appl. 09(02), 3362–3375 (2017). ISSN:0975-0290

    Google Scholar 

  12. Clauset, A., Newman, M., Moore, C.: Finding community structure in very large networks. Phys. Rev. E 70, 066111 (2004). [Online]. Available: http://www.citebase.org/cgibin/citations?id=oai:arXiv.org:cond-mat/0408187

  13. Clauset, et al.: A comparative analysis of community detection algorithms on artificial networks. Scientific reports|6:30750| (2016) https://doi.org/10.1038/srep30750

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

    Article  Google Scholar 

  15. Radicchi, F., Castellano, C., Cecconi, F., Loreto, V., Parisi, D.: Defining and identifying communities in networks. Preprint cond-mat/0309488 (2003)

    Google Scholar 

  16. Rao Chintalapudi, S., Prasad, M.H.M.K.: A survey on community detection algorithms in large scale real world networks. In: 2015 2nd International Conference on Computing for Sustainable Global Development (INDIACom), New Delhi, pp. 1323–1327 (2015)

    Google Scholar 

  17. Fortunato, S.: Community detection in networks: a user guide (2016) arXiv:1608.00163v2 [physics.soc-ph]

  18. Girvan, M., New man, M.E.J.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. USA 99, 7821–7826 (2002)

    Article  MathSciNet  Google Scholar 

  19. Rao Chintalapudi, S., Krishna Prasad, M.H.M.: Community Detection in Large-Scale Social networks: A Survey (2018). https://doi.org/10.4018/978-1-5225-2814-2.ch012

  20. Bojewar, S., Naik, A.P.: A survey paper on Techniques used for Community detection in social networks. In: International Conference on Emanations in Modern Technology and Engineering (ICEMTE-2017), vol. 5(3) (2017)

    Google Scholar 

  21. Tyler, J.R., Wilkinson, D.M., Huberman, B.A.: Email as spectroscopy: automated discovery of community structure within organizations. In: M. Huysman, E. Wenger, V. Wulf (eds.) Proceedings of the First International Conference on Communities and Technologies, Kluwer, Dordrecht (2003)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to K. Chandusha .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Chandusha, K., Chintalapudi, S.R., Krishna Prasad, M.H.M. (2019). An Empirical Study on Community Detection Algorithms. In: Satapathy, S., Bhateja, V., Das, S. (eds) Smart Intelligent Computing and Applications . Smart Innovation, Systems and Technologies, vol 104. Springer, Singapore. https://doi.org/10.1007/978-981-13-1921-1_4

Download citation

  • DOI: https://doi.org/10.1007/978-981-13-1921-1_4

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-13-1920-4

  • Online ISBN: 978-981-13-1921-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics