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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.