Advertisement

Block diagonal dominance-based dynamic programming for detecting community

Abstract

Clustering or partition is a fundamental work for graph or network. Detecting communities is a typical clustering, which divides a network into several parts according to the modularity. Community detection is a critical challenge for designing scalable, adaptive and survivable trust management protocol for a community of interest-based social IoT system. Most of the existed methods on community detection suffer from a common issue that the number of communities should be prior decided. This urges us to estimate the number of communities from the data by some way. This paper concurrently considers eliminating the number of communities and detecting communities based on block diagonal dominace adjacency matrix. To construct a block diagonal dominance adjacency matrix for the input network, it first reorders the node number by the breadth-first search algorithm. For the block diagonal dominance adjacency matrix, this paper shows that the numbers of nodes in a community should be continuous adjacent. And thus, it only needs insert some breakpoints in node number sequence to decide the number of communities and the nodes in every community. In addition, a dynamic programming algorithm is designed to achieve an optimal community detection result. Experimental results on a number of real-world networks show the effectiveness of the dynamic programming approach on the community detection problem.

This is a preview of subscription content, log in to check access.

Access options

Buy single article

Instant unlimited access to the full article PDF.

US$ 39.95

Price includes VAT for USA

Subscribe to journal

Immediate online access to all issues from 2019. Subscription will auto renew annually.

US$ 199

This is the net price. Taxes to be calculated in checkout.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

References

  1. 1.

    Atzori L, Iera A, Morabito G (2010) The internet of things: a survey. Comput Netw 54(15):2787–2805

  2. 2.

    Atzori L, Iera A, Morabito G (2011) SIoT: giving a social structure to the internet of things. IEEE Commun Lett 15(11):1193–1195

  3. 3.

    Blondel VD, Guillaume J-L, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks. J Stat Mech: Theory Exp 10:P10008

  4. 4.

    Bruna J, Li X (2017) Community detection with graph neural networks. arXiv preprint, arXiv:1705.08415

  5. 5.

    Chen T, Singh P, Bassler KE (2018) Network community detection using modularity density measures. J Stat Mech Theory Exp 053406

  6. 6.

    Chen Z, Li L, Bruna J (2019) Supervised community detection with hierarchical graph neural networks. In International Conference on Learning Representations (ICLR)

  7. 7.

    Chen C-M, Xiang B, Liu Y, Wang K-H (2019) A secure authentication protocol for internet of vehicles. IEEE Access 7(1):12047–12057

  8. 8.

    Come E, Latouche P (2015) Model selection and clustering in stochastic block models based on the exact integrated complete data likelihood. Stat Model 15:564–589

  9. 9.

    Daudin JJ, Picard F, Robin S (2008) A mixture model for random graphs. Stat Comput 18:173–183

  10. 10.

    Fortunato S (2010) Community detection in graphs. Phys Rep 486:75–174

  11. 11.

    Fortunato S, Hric D (2016) Community detection in networks: a user guide. Phys Rep 659:1–44

  12. 12.

    Girvan M, Newman MEJ (2002) Community structure in social and biological networks. Proc Natl Acad Sci USA 99:7821–7826

  13. 13.

    Guo K, Guo W, Chen Y, Qiu Q, Zhang Q (2015) Community discovery by propagating local and global information based on the MapReduce model. Inf Sci 323:73–93

  14. 14.

    Guimera R, Sales-Pardo M (2009) Missing and spurious interactions and the reconstruction of complex networks. Proc Natl Acad Sci USA 106:22073–22078

  15. 15.

    Handcock MS, Raftery AE, Tantrum JM (2007) Model-based clustering for social networks. J R Stat Soc A 170:301–354

  16. 16.

    He K, Zhang X, Ren S, Sun J (2016) Deep residual learning for image recognition. Comput Vis Pattern Recogn, pp 770–778

  17. 17.

    Karrer B, Newman MEJ (2011) Stochastic block models and community structure in networks. Phys Rev E 83:016107

  18. 18.

    Krzakala F, Moore C, Mossel E, Neeman J, Sly A, Zdeborov L, Zhang P (2013) Spectral redemption in clustering sparse networks. Proc Nat Acad Sci 110(52):20935–20940

  19. 19.

    Latouche P, Birmel’e E, Ambroise C (2009) Bayesian methods for graph clustering. In Advances in Data Analysis, Data Handling, and Business Intelligence. Springer, Berlin, pp 229–239

  20. 20.

    Latouche P, Birmele E, Ambroise C (2012) Variational Bayesian inference and complexity control for stochastic block models. Stat Model 12:93–115

  21. 21.

    Luo F, Guo W, Yu Y, Chen G (2016) A multi-label classification algorithm based on kernel extreme learning machine. Neurocomputing 260:313–320

  22. 22.

    Massouli’e L (2014) Community detection thresholds and the weak Ramanujan property. In Proceedings of the 46th Annual ACM Symposium on the Theory of Computing, pp 694–703, Association of Computing Machinery, New York

  23. 23.

    McDaid AF, Murphy TB, Friel N, Hurley N (2013) Improved Bayesian inference for the stochastic block model with application to large networks. Comput Stat Data Anal 60:12–31

  24. 24.

    Newman MEJ, Reinert G (2016) Estimating the number of communities in a network. Phys Rev Lett 117:078301

  25. 25.

    Newman M E J (2016) Community detection in networks: Modularity optimization and maximum likelihood are equivalent. arXiv preprint arXiv:1606.02319

  26. 26.

    Pan J-S, Lee C-Y, Sghaier A, Zeghid M, Xie J (2019) Novel systolization of subquadratic space complexity multipliers based on toeplitz matrix-vector product approach. IEEE Trans Very Large Scale Int Syst 27(7):1614–1622

  27. 27.

    Peixoto TP (2014) Hierarchical block structures and high-resolution model selection in large networks. Phys Rev X 4:011047

  28. 28.

    Peixoto TP (2017) Nonparametric Bayesian inference of the microcanonical stochastic block model. Phys Rev E 95:012317

  29. 29.

    Riolo M A, Cantwell G T, Reinert G, Newman M E J (2017) Efficient method for estimating the number of communities in a network. arXiv:1706.02324v1

  30. 30.

    Sukhbaatar S, Szlam A, Fergus R (2016) Learning multiagent communication with backpropagation. Adv Neural Inf Process Syst, pp 2244–2252

  31. 31.

    Tai K, Socher R, Manning C (2015) Improved semantic representations from tree-structured long short-term memory networks. Association for Computational Linguistics (ACL), pp 1556–1566

  32. 32.

    Wang S, Guo W (2017) Sparse multi-graph embedding for multimodal feature representation. IEEE Trans Multimedia 19(7):1454–1466

  33. 33.

    Wu T-Y, Chen C-M, Wang K-H, Meng C, Wang EK (2019) A provably secure certificateless public key encryption with keyword search. J Chinese Inst Eng 42(1):20–28

  34. 34.

    Yan X (2016) Bayesian model selection of stochastic block models. In Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, pp 323–328

  35. 35.

    Yang J, Leskovec J (2015) Defining and evaluating network communities based on ground-truth. Knowl Inf Syst 42:181–213

  36. 36.

    Yang Y, Liu X, Zheng X, Rong C, Guo W (2018) Efficient traceable authorization search system for secure cloud storage. IEEE Trans Cloud Comput. https://doi.org/10.1109/TCC.2018.2820714

  37. 37.

    Ye F, Chen C, Wen Z, Zheng Z, Chen W, Zhou Y (2019) Homophily preserving community detection. IEEE Trans Neural Netw Learn Syst. https://doi.org/10.1109/TNNLS.2019.2933850

Download references

Acknowledgements

This work was supported in part by the National Natural Science Foundation of China (NSFC) under Grants (No. 61907024), and the Starting Research Fund from Minnan Normal University (No. KJ18009), and the Open Fund of Key Laboratory of Urban Land Resources Monitoring and Simulation, Ministry of Land and Resources (No. KF201803065).

Author information

Correspondence to Xingquan Li.

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

Verify currency and authenticity via CrossMark

Cite this article

Li, X., Cao, C. & Zhang, T. Block diagonal dominance-based dynamic programming for detecting community. J Supercomput (2020) doi:10.1007/s11227-020-03151-y

Download citation

Keywords

  • Social IoT system
  • Community of interest network
  • Block diagonal dominance matrix
  • Dynamic programming
  • Deep graph neural network