Deep Auto‐encoded Clustering Algorithm for Community Detection in Complex Networks. Issue 3 (1st May 2019)

• Record Type: Journal Article
• Authors: Wang, Feifan; Zhang, Baihai; Chai, Senchun
• Is Part Of: Chinese journal of electronics. Volume 28:Issue 3(2019)
• Page Start: 489
• Page End: 496
• Publication Date: 2019-05-01
• Subjects: Deep learning -- Community detection -- Autoencoder -- Complex networks; complex networks -- eigenvalues and eigenfunctions -- graph theory -- learning (artificial intelligence) -- matrix algebra -- network theory (graphs) -- pattern clustering; complex networks -- deep learning -- DAC -- unsupervised autoencoders -- sparse single autoencoders -- key community information -- lower‐dimensional representation -- clustering strategies -- synthetic world networks -- real world networks -- spectral community detection algorithm -- k‐means community detection method -- time‐consuming eigenvalue decomposition procedure -- sparsity constraints -- community detection algorithm -- deep auto‐encoded clustering algorithm; Electronics -- Periodicals; Electronics -- China -- Periodicals; Electronics; China; Periodicals; 621.38105
• DOI: 10.1049/cje.2019.03.019
• Languages: English
• ISSNs: 1022-4653

Abstract

Abstract : The prevalence of deep learning has inspired innovations in numerous research fields including community detection, a cornerstone in the advancement of complex networks. We propose a novel community detection algorithm called the Deep auto‐encoded clustering algorithm (DAC), in which unsupervised and sparse single autoencoders are trained and piled up one after another to embed key community information in a lower‐dimensional representation, such that it can be handled easier by clustering strategies. Extensive comparison tests undertaken on synthetic and real world networks reveal two advantages of the proposed algorithm: on the one hand, DAC shows higher precision than the k ‐means community detection method benefiting from the integration of sparsity constraints. On the other hand, DAC runs much faster than the spectral community detection algorithm based on the circumvention of the time‐consuming eigenvalue decomposition procedure.