Unsupervised Community Discovery Algorithm via Reconstructed Graph Neural NEtwork

Community discovery can help discover potential community structures in the network, which is a fundamental and important issue in network science. Graph neural network-based algorithms are receiving increasing attention. However, there is relatively little work on community discovery directly using graph neural networks in reconstruction design. This paper presents an Unsupervised Community Discovery Algorithm based on reconstructed graph neural network (UCDA) to resolve the above issues. To be specific, this paper proposes a framework that learns the representation based on network structure and attribute information. By designing input network features, encoders, decoders, this algorithm uses an unsupervised loss function to train neural networks to extract communities in an integrated way. These designs integrate higher-order modularity information with network features and use variational graph auto-encoders to train data end-to-end under the graph neural network framework. Based on a series of experiments with a wide range of datasets and advanced algorithms, UCDA has achieved superior performance and shows strong competitiveness. Finally, the last section reports the results analysis, t-SNE visualization and hyperparameter analysis, which depicts stable performance and powerful network modularity ability.