Skip to main content

Processing Overlapping Communities Using the Gradient Descent Optimization Method

  • Conference paper
  • First Online:
Advances in Information and Communication Technology (ICTA 2023)

Part of the book series: Lecture Notes in Networks and Systems ((LNNS,volume 847))

  • 200 Accesses

Abstract

Community structure detection is an important study in social network analysis, especially with complex networks. In a community structure, usually, a node belongs to only one community. In reality, however, networks are built in different relationships and nodes can be shared by multiple communities. An overlapping node is a vertex that belongs to more than one community. The concept of overlapping community has emerged and has great practical significance for applications on social networks. To detect, analyze or process overlapping communities, many soft algorithms (probability-based computation, giving acceptable results…) are proposed to perform. In this study, we introduce the tool “Maximum Likelihood Estimation-MLE, a commonly used tool in machine learning, then apply Gradient descent to calculate the extrema for the proposed objective function. The experimental results prove the flexibility and effectiveness of the proposed method, which is good support for further studies on social network analysis and graph data mining.

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 149.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 199.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

Similar content being viewed by others

References

  1. Devi, J.C., Poovammal, E.: An analysis of overlapping community detection algorithms in social networks. In: Twelfth International Multi-Conference on Information Processing IMCIP (2016)

    Google Scholar 

  2. Gregory, S.: A fast algorithm to find overlapping communities in networks Lect. In: ECMLPKDD’08, Volume Part I September 2008, pp. 408–423 (2008)

    Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Google Scholar 

  5. Palla, G., Deresnyi, I., Farkas, I.: Uncovering the overlapping community structure of complex networks in nature and society. Nature 435, 814–818 (2005)

    Article  Google Scholar 

  6. Saradha, C.S., Arul, D.P.: An optimized overlapping and disjoint community detection techniques using improved community overlap propagation algorithm in complex networks. Adv. Sci. Res. JCR 7(4), 782–790 (2020)

    Google Scholar 

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

    Article  Google Scholar 

  8. Rossi, R.J.: Mathematical Statistics: An Introduction to Likelihood Based Inference, p. 227. John Wiley & Sons, New York. ISBN 978–1–118–77104–4 (2018)

    Google Scholar 

  9. David, H., Nielsen, B.: Econometric modeling: a likelihood approach. Princeton University Press, Princeton. ISBN 978–0–691–13128–3 (2007)

    Google Scholar 

  10. Glasmachers, T., Igel, C.: Gradient-based adaptation of general Gaussian kernels. Neural Comput. 17(10), 2099–2105 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  11. Ruder, S.: An overview of gradient descent optimisation algorithms. arXiv preprint: 1609.04747 [cs.LG] (2016)

    Google Scholar 

  12. Trinh, N.H., Quang, V.V.: The application of range clustering method in community detecting problem. TNU J. Sci. Technol. 255(06), 303–310. eISSN: 2615–9562, ISSN: 1859–2171, 2734–9098 (2020)

    Google Scholar 

  13. Leskovec, J., Krevl, A.: SNAP datasets tanford large network dataset collection, [Online]. Available: https://snap.stanford.edu. Accessed 15 May 2023 (2014)

  14. Luo, W., Lu, N., Ni, L., Zhu, W., Ding, W.: Local community detection by the nearest nodes with greater centrality. Inf. Sci. 517, 377–392 (2020)

    Article  MathSciNet  Google Scholar 

  15. Su, Y., Zhou, K., Zhang, X., Cheng, R., Zheng, C.: A parallel multi-objective evolutionary algorithm for community detection in large-scale complex networks. Inf. Sci. 576, 374–392 (2021)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Nguyen Hien Trinh .

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

Trinh, N.H., Tung, C.T. (2023). Processing Overlapping Communities Using the Gradient Descent Optimization Method. In: Nghia, P.T., Thai, V.D., Thuy, N.T., Son, L.H., Huynh, VN. (eds) Advances in Information and Communication Technology. ICTA 2023. Lecture Notes in Networks and Systems, vol 847. Springer, Cham. https://doi.org/10.1007/978-3-031-49529-8_31

Download citation

Publish with us

Policies and ethics