Skip to main content
Log in

A pyramidal community detection algorithm based on a generalization of the clustering coefficient

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

Abstract

The detection of community structure has aroused wide attention since it can reveal the underlying properties of complex networks in biology, as well as physical and social sciences. Many community detection algorithms have been proposed to detect the communities in the un-weighted networks. However, the recently high-level of interest in complex weighted networks gives rise to a need to develop new methods and measures to take the weights of links into account. To fulfill the above needs, we propose a new generalization of the clustering coefficient that retains the information encoded in the weights of links and thus fully capture the richness of the information contained in the data. We also define a new generation of the complete graph (CG) of a weighted network based on the maximal weight attached to each node. Furthermore, we use the weighted clustering coefficient (WCC) and CG to design a novel community detection algorithm based on a proposed pyramidal clustering. It performs in three main steps. In the first step, the CG is generated, and the WCC is computed for all the nodes. The second step uses CG and WCC to divide the network into a set of pyramidal clusters (PCs), where each PC has a score. For the final steps, we propose a measure for the clusters, called connectivity, that computes the degree of connectivity between the PCs. Pairs of PCs with high connectivity are merged until the degree of connectivity between all the clusters is low. The experiment results on weighted and un-weighted real-world networks show that the proposed method outperforms other state-of-art algorithms in terms of normalized mutual information and modularity.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11

Similar content being viewed by others

References

Download references

Acknowledgement

This research is supported by the National Natural Science Foundation of China (No: 61672124), the Password Theory Project of the 13th Five-Year Plan National Cryptography Development Fund (No: MMJJ20170203), Liaoning Province Science and Technology Innovation Leading Talents Program Project (No: XLYC1802013), Key R&D Projects of Liaoning Province (No: 2019020105-JH2/103), Jinan City '20 universities' Funding Projects Introducing Innovation Team Program (No: 2019GXRC031).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xingyuan Wang.

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

Midoun, M.A., Wang, X. & Talhaoui, M.Z. A pyramidal community detection algorithm based on a generalization of the clustering coefficient. J Ambient Intell Human Comput 12, 9111–9125 (2021). https://doi.org/10.1007/s12652-020-02608-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12652-020-02608-5

Keywords

Navigation