Skip to main content
SpringerLink
Log in

Deep learning-based community detection in complex networks with network partitioning and reduction of trainable parameters

  • Original Research
  • Published:
Journal of Ambient Intelligence and Humanized Computing Aims and scope Submit manuscript

Abstract

Community detection in complex networks is an important multidisciplinary research area and is considered crucial for understanding the structure of complex networks. Unsupervised deep learning models (e.g. stack autoencoders) have been successfully proposed for the problem of community detection, which can extract network features and use them in splitting the network into communities. Despite their effectiveness, these methods are not very efficient, especially when large networks are involved. Furthermore, existing models usually handle the network as a single object, which means that massive trainable parameters are required during training (which in normal complex networks often reach millions of parameters, not to mention large networks), thereby increasing the complexity of the model. To overcome these problems, this paper proposes a deep autoencoder method for network community detection based on three techniques: network-data partitioning, reduction and sharing of trainable parameters, which contribute significantly to improve the efficiency of the method. A new partitioning strategy is imposed on complex networks at different levels. The paper also proposes a parallel design for the proposed method. Furthermore, a new similarity constraint function is proposed to improve and preserve the performance of community detection task. We performed extensive experiments for different partitioning levels of a network-dataset to evaluate the method with CPU and GPU devices. The results showed that the proposed method significantly improved training speed and efficiency while maintaining performance. The results also showed that the efficiency of the method increases as we move to a deeper level of partitioning.

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

Similar content being viewed by others

Notes

  1. https://github.com/zepx/graphencoder.

  2. https://yangliang.github.io/code/DC.zip.

  3. https://github.com/smartyfh/DANMF.

  4. https://github.com/dilberdillu/community-detection-DL.

References

  • Adamic L A, Glance N (2005) The political blogosphere and the 2004 US election: divided they blog. In: Proceedings of the 3rd international workshop on Link discovery

  • Aich S, Yamazaki M, Taniguchi Y, Stavness I (2020) Multi-scale weight sharing network for image recognition. Pattern Recognit Lett 131:348–354. https://doi.org/10.1016/j.patrec.2020.01.011

    Article  Google Scholar 

  • Alandoli M, Al-Ayyoub M, Al-Smadi M, Jararweh Y, Benkhelifa E (2016) Using dynamic parallelism to speed up clustering-based community detection in social networks. In: 2016 IEEE 4th international conference on future internet of things and cloud workshops (FiCloudW)

  • Alandoli M, Shehab M, Al-Ayyoub M, Jararweh Y, Al-Smadi M (2016) Using gpus to speed-up fcm-based community detection in social networks. In: 2016 7th international conference on computer science and information technology (CSIT)

  • Al-Ayyoub M, Al-andoli M, Jararweh Y, Smadi M, Gupta B (2019) Improving fuzzy C-mean-based community detection in social networks using dynamic parallelism. Comput Electr Eng 74:533–546. https://doi.org/10.1016/j.compeleceng.2018.01.003

    Article  Google Scholar 

  • Bonchi F, Castillo C, Gionis A, Jaimes A (2011) Social network analysis and mining for business applications. ACM Trans Intell Syst Technol (TIST) 2(3):22. https://doi.org/10.1145/1961189.1961194

    Article  Google Scholar 

  • Boulch A (2018) Reducing parameter number in residual networks by sharing weights. Pattern Recognit Lett 103:53–59. https://doi.org/10.1016/j.patrec.2018.01.006

    Article  Google Scholar 

  • Brandes U, Delling D, Gaertler M, Gorke R, Hoefer M, Nikoloski Z, Wagner D (2007) On modularity clustering. IEEE Trans Knowl Data Eng 20(2):172–188. https://doi.org/10.1109/TKDE.2007.190689

    Article  MATH  Google Scholar 

  • Cammerer S, Gruber T, Hoydis J, Ten Brink S (2017) Scaling deep learning-based decoding of polar codes via partitioning. In: GLOBECOM 2017–2017 IEEE global communications conference

  • Cao J, Jin D, Dang J (2018) Autoencoder based community detection with adaptive integration of network topology and node contents. In: International conference on knowledge science, engineering and management

  • Dai D, Yu L, Wei H (2019) Parameters sharing in residual neural networks. Neural Process Lett. https://doi.org/10.1007/s11063-019-10143-4

    Article  Google Scholar 

  • Dhilber M, Bhavani S D (2020) Community detection in social networks using deep learning. In: International conference on distributed computing and internet technology

  • Dong Z, Wang S, Liu Q (2020) Spectral based hypothesis testing for community detection in complex networks. Inf Sci 512:1360–1371. https://doi.org/10.1016/j.ins.2019.10.056

    Article  MathSciNet  Google Scholar 

  • Freeman LC (1977) A set of measures of centrality based on betweenness. Sociometry. https://doi.org/10.2307/3033543

    Article  Google Scholar 

  • Girvan M, Newman ME (2002) Community structure in social and biological networks. Proc Natl Acad Sci 99(12):7821–7826. https://doi.org/10.1073/pnas.122653799

    Article  MathSciNet  MATH  Google Scholar 

  • He T, Cai L, Meng T, Chen L, Deng Z, Cao Z (2018) Parallel community detection based on distance dynamics for large-scale network. IEEE Access 6:42775–42789. https://doi.org/10.1109/ACCESS.2018.2859788

    Article  Google Scholar 

  • Hu L, Gorton I (1997) Performance evaluation for parallel systems: a survey. Citeseer

  • Hu B, Wang H, Yu X, Yuan W, He T (2019) Sparse network embedding for community detection and sign prediction in signed social networks. J Ambient Intell Humaniz Comput 10(1):175–186. https://doi.org/10.1007/s12652-018-1159-7

    Article  Google Scholar 

  • Hubert L, Arabie P (1985) Comparing partitions. J Classif 2(1):193–218. https://doi.org/10.1007/BF01908075

    Article  MATH  Google Scholar 

  • Javed MA, Younis MS, Latif S, Qadir J, Baig A (2018) Community detection in networks: a multidisciplinary review. J Netw Comput Appl 108:87–111. https://doi.org/10.1016/j.jnca.2018.02.011

    Article  Google Scholar 

  • Khaire UM, Dhanalakshmi R (2020) High-dimensional microarray dataset classification using an improved adam optimizer (iAdam). J Ambient Intell Humaniz Comput. https://doi.org/10.1007/s12652-020-01832-3

    Article  MATH  Google Scholar 

  • Khatoon M, Banu WA (2015) A survey on community detection methods in social networks. Int J Educ Manag Eng 5(1):8. https://doi.org/10.5815/ijeme.2015.01.02

    Article  Google Scholar 

  • Li P (2010) Community structure discovery algorithm on gpu with cuda. In: 2010 3rd IEEE international conference on broadband network and multimedia technology (IC-BNMT)

  • Lusseau D, Schneider K, Boisseau OJ, Haase P, Slooten E, Dawson SM (2003) The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations. Behav Ecol Sociobiol 54(4):396–405. https://doi.org/10.1007/s00265-003-0651-y

    Article  Google Scholar 

  • MacQueen J (1967) Some methods for classification and analysis of multivariate observations. In: Proceedings of the fifth Berkeley symposium on mathematical statistics and probability

  • Madiajagan M, Raj SS (2019) Parallel computing, graphics processing unit (GPU) and new hardware for deep learning in computational intelligence research. Deep learning and parallel computing environment for bioengineering systems. Elsevier, Amsterdam, pp 1–15. https://doi.org/10.1016/B978-0-12-816718-2.00008-7

    Chapter  Google Scholar 

  • McAuley J, Leskovec J (2012) Learning to discover social circles in ego networks. In: Pereira F, Burges CJC, Bottou L, Weinberger KQ (eds) Advances in neural information processing systems 25. Curran Associates Inc, pp 539–547

  • Moon S, Lee JG, Kang M, Choy M, Lee J (2016) Parallel community detection on large graphs with MapReduce and GraphChi. Data Knowl Eng 104:17–31. https://doi.org/10.1016/j.datak.2015.05.001

    Article  Google Scholar 

  • Navarro CA, Hitschfeld-Kahler N, Mateu L (2014) A survey on parallel computing and its applications in data-parallel problems using GPU architectures. Commun Comput Phys 15:285–329. https://doi.org/10.4208/cicp.110113.010813a

    Article  MathSciNet  MATH  Google Scholar 

  • Newman ME (2006) Modularity and community structure in networks. Proc Natl Acad Sci 103(23):8577–8582. https://doi.org/10.1073/pnas.0601602103

    Article  Google Scholar 

  • Newman MEJ, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev E. https://doi.org/10.1103/physreve.69.026113

    Article  Google Scholar 

  • Ng AY, Jordan MI, Weiss Y (2002) On spectral clustering: analysis and an algorithm. In: Dietterich TG, Becker S, Ghahramani Z (eds) Advances in neural information processing systems 14. MIT Press, Cambridge, MA, pp 849–856

  • Niu S, Wang D, Feng S, Yu G (2009) An improved spectral clustering algorithm for community discovery. In: 2009 ninth international conference on hybrid intelligent systems

  • Pinaya WHL, Vieira S, Garcia-Dias R, Mechelli A (2020) Autoencoders. Machine learning. Elsevier, Amsterdam, pp 193–208. https://doi.org/10.1016/B978-0-12-815739-8.00011-0

    Chapter  Google Scholar 

  • Pinheiro CAR (2012) Community detection to identify fraud events in telecommunications networks. In: SAS SUGI proceedings: customer intelligence

  • Pons P, Latapy M (2005) Computing communities in large networks using random walks. In: International symposium on computer and information sciences

  • Prat-Pérez A, Dominguez-Sal D, Larriba-Pey J-L (2014). High quality, scalable and parallel community detection for large real graphs. In: Proceedings of the 23rd international conference on World Wide Web

  • Rosvall M, Bergstrom CT (2008) Maps of random walks on complex networks reveal community structure. Proc Natl Acad Sci 105(4):1118–1123. https://doi.org/10.1073/pnas.0706851105

    Article  Google Scholar 

  • Rozemberczki B, Allen C, Sarkar R (2019) Multi-scale attributed node embedding. arXiv preprint arXiv:1909.13021

  • Salha G, Hennequin R, Tran VA, Vazirgiannis M (2019) A degeneracy framework for scalable graph autoencoders. arXiv preprint arXiv:1902.08813

  • Sani NS, Manthouri M, Farivar F (2020) A multi-objective ant colony optimization algorithm for community detection in complex networks. J Ambient Intell Humaniz Comput 11(1):5–21. https://doi.org/10.1007/s12652-018-1159-7

    Article  Google Scholar 

  • Soman J, Narang A (2011) Fast community detection algorithm with gpus and multicore architectures. In: 2011 IEEE international parallel and distributed processing symposium

  • Tang J, Hu X, Liu H (2013) Social recommendation: a review. Soc Netw Anal Min 3(4):1113–1133. https://doi.org/10.1007/s13278-013-0141-9

    Article  Google Scholar 

  • Tian F, Gao B, Cui Q, Chen E, Liu T-Y (2014) Learning deep representations for graph clustering. In: Twenty-eighth AAAI conference on artificial intelligence

  • Van Der Maaten L, Postma E, Van den Herik J (2009) Dimensionality reduction: a comparative. J Mach Learn Res 10(66–71):13

    Google Scholar 

  • Wang F, Zhang B, Chai S (2019) Deep auto-encoded clustering algorithm for community detection in complex networks. Chin J Electron 28(3):489–496

    Article  Google Scholar 

  • Wójcik PI, Kurdziel M (2019) Training neural networks on high-dimensional data using random projection. Pattern Anal Appl 22(3):1221–1231. https://doi.org/10.1007/s10044-018-0697-0

    Article  MathSciNet  Google Scholar 

  • Wu CW (2018) ProdSumNet: reducing model parameters in deep neural networks via product-of-sums matrix decompositions. arXiv preprint arXiv:1809.02209

  • Xie J, Kelley S, Szymanski BK (2013) Overlapping community detection in networks: the state-of-the-art and comparative study. ACM Comput Surv (CSUR) 45(4):1–35. https://doi.org/10.1145/2501654.2501657

    Article  MATH  Google Scholar 

  • Xie Y, Gong M, Wang S, Yu B (2018) Community discovery in networks with deep sparse filtering. Pattern Recognit 81:50–59. https://doi.org/10.1016/j.patcog.2018.03.026

    Article  Google Scholar 

  • Yang T, Jin R, Chi Y, Zhu S (2009) Combining link and content for community detection: a discriminative approach. In: Proceedings of the 15th ACM SIGKDD international conference on knowledge discovery and data mining

  • Yang L, Cao X, He D, Wang C, Wang X, Zhang W (2016) Modularity based community detection with deep learning. In: IJCAI

  • Ye F, Chen C, Zheng Z (2018) Deep autoencoder-like nonnegative matrix factorization for community detection. In: Proceedings of the 27th ACM international conference on information and knowledge management

  • Zachary WW (1977) An information flow model for conflict and fission in small groups. J Anthropol Res 33(4):452–473. https://doi.org/10.1086/jar.33.4.3629752

    Article  Google Scholar 

  • Zhang LM (2020) PairNets: novel fast shallow artificial neural networks on partitioned subspaces. arXiv preprint arXiv:2001.08886

  • Zhang X, Newman ME (2015) Multiway spectral community detection in networks. Phys Rev E 92(5):052808. https://doi.org/10.1103/PhysRevE.92.052808

    Article  Google Scholar 

Download references

Funding

This work was supported by the Fundamental Research Grant Scheme (FRGS) from the Ministry of Higher Education and Multimedia University, Malaysia (Project ID: FRGS/1/2018/ICT02/MMU/02/1).

Author information

Authors and Affiliations

  1. Faculty of Information Science and Technology, Multimedia University, Jalan Ayer Keroh Lama, Bukit Beruang, Melaka, Malaysia

    Mohammed Al-Andoli, Wooi Ping Cheah & Shing Chiang Tan

Authors
  1. Mohammed Al-Andoli
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wooi Ping Cheah
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Shing Chiang Tan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wooi Ping Cheah.

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

Al-Andoli, M., Cheah, W.P. & Tan, S.C. Deep learning-based community detection in complex networks with network partitioning and reduction of trainable parameters. J Ambient Intell Human Comput 12, 2527–2545 (2021). https://doi.org/10.1007/s12652-020-02389-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12652-020-02389-x

Keywords

Search

Navigation