Optimization and Application of Clustering Algorithm in Community Discovery

Abstract

In order to make up for the defect that the traditional spectral clustering algorithm cannot determine the number of clusters and the time-consuming calculation, this paper studies and improves the spectral clustering algorithm. In complex community networks, the spectral clustering algorithm based on modularity optimization is chosen to find the number of communities. In addition, four types of user attribute information are integrated, and a more reasonable user similarity model is constructed. At the same time, the original non-parallelized spectral clustering algorithm is optimized, and its improved scheme is suitable for the application of distributed computing. Many Hadoop optimization strategies are proposed for virtual community discovery scenarios in large-scale communities. Finally, the experimental results show that the efficiency of the parallelized spectral clustering algorithm is greatly improved, which can be applied to the virtual community discovery in large-scale social networks.