Skip to main page content
U.S. flag

An official website of the United States government

Dot gov

The .gov means it’s official.
Federal government websites often end in .gov or .mil. Before sharing sensitive information, make sure you’re on a federal government site.

Https

The site is secure.
The https:// ensures that you are connecting to the official website and that any information you provide is encrypted and transmitted securely.

Access keys NCBI Homepage MyNCBI Homepage Main Content Main Navigation
. 2024 Oct 10;14(1):23741.
doi: 10.1038/s41598-024-74361-0.

Identification of dynamic networks community by fusing deep learning and evolutionary clustering

Affiliations

Identification of dynamic networks community by fusing deep learning and evolutionary clustering

Yu Pan et al. Sci Rep. .

Abstract

Community detection is a critical component of network analysis and a hot topic in social computing. Detecting community structure in dynamic networks has important theoretical and practical implications for understanding the intrinsic function of networks and predicting network behavior. However, the majority of existing dynamic community detection methods adopt shallow models, which have limited ability to excavate complex non-linear structures and tend to generate undesirable community structures. In order to obtain an accurate and robust community structure in dynamic networks, we are inspired by network representation learning and utilize the deep learning to detect evolving communities in dynamic networks. In this paper, we propose a novel dynamic community detection method by fusing Deep Learning and Evolutionary Clustering (DLEC). This work attempts to combine deep learning and evolutionary clustering into a unified framework. First, we propose a matrix construction strategy to fully reveal the inherent community structures via the underlying community memberships. Then, we develop a novel multi-layer deep autoencoder framework that consists of multiple non-linear functions to extract the latent deep representation of the dynamic network. Based on the evolutionary clustering framework, a graph regularization term is introduced to ensure the smoothness of the community evolution. Finally, we employ the K-means clustering algorithm on the low-dimensional network space to obtain the community structure. Extensive experimental results on synthetic and real-world networks show that the proposed DLEC algorithm can effectively detect high-quality communities in dynamic networks.

PubMed Disclaimer

Conflict of interest statement

The authors declare no competing interests.

Figures

Figure 1
Figure 1
The framework of DLEC.
Figure 2
Figure 2
The schematic diagram of network latent community structure.
Figure 3
Figure 3
Example of the network representation: adjacency matrix A and community similarity matrix X.
Figure 4
Figure 4
Example of using autoencoder for community detection in a snapshot.
Algorithm 1
Algorithm 1
DLEC: Identification of dynamic networks community by fusing deep learning and evolutionary clustering.
Figure 5
Figure 5
Comparison results of the algorithms on Synthetic Dataset 1 in terms of NMI. (A) SYN-FIX, zout = 3, (B) SYN-FIX, zout = 5.
Figure 6
Figure 6
Comparison results of the algorithms on Synthetic Dataset 1 in terms of NMI. (A) SYN-VAR, zout = 3, (B) SYN-VAR, zout = 5.
Figure 7
Figure 7
Comparison results of the algorithms on Synthetic Dataset 2 in terms of NMI. (A) zout = 5, C% = 10%, (B) zout = 5, C% = 30%.
Figure 8
Figure 8
Comparison results of the algorithms on Synthetic Dataset 2 in terms of NMI. (A) zout = 6, C% = 10%, (B) zout = 6, C% = 30%.
Figure 9
Figure 9
Comparison results of the algorithms on KIT-Email in terms of ER.
Figure 10
Figure 10
Comparison results of the algorithms on Enron email dataset in terms of NMI.
Figure 11
Figure 11
Visualization of community evolution of Enron email dataset at different times.
Figure 12
Figure 12
The community detection results over different α on datasets. (A) LNetwork1 dataset, (B) KIT-mail dataset.

Similar articles

References

    1. Mohebbi, F., Zelikovsky, A., Mangul, S., Chowell, G. & Skums, P. Early detection of emerging viral variants through analysis of community structure of coordinated substitution networks. Nat. Commun. 15, 2838 (2024). - PMC - PubMed
    1. Kritschgau, J. et al. Community detection in hypergraphs via mutual information maximization. Sci. Rep. 14, 6933 (2024). - PMC - PubMed
    1. Wang, S. et al. Community detection in dynamic networks using constraint non-negative matrix factorization. Intell. Data Anal. 24, 119–139. 10.3233/IDA-184432 (2020).
    1. Zhou, J. et al. Robustecd: Enhancement of network structure for robust community detection. IEEE Trans. Knowl. Data Eng. 35, 842–856. 10.1109/TKDE.2021.3088844 (2023).
    1. Rustamaji, H. C., Kusuma, W. A., Nurdiati, S. & Batubara, I. Community detection with greedy modularity disassembly strategy. Sci. Rep. 14, 4694 (2024). - PMC - PubMed

LinkOut - more resources