基于学术社团中心度的合著网络社区发现算法

he existing co-authorship network community division algorithm is not enough to reflect the characteristics of co-authorship network. A new community division algorithm based on academic community center degree is proposed. Firstly, the algorithm calculates each author's academic community center degree by considering the coherence of the author's relationship strength, then applies it to the second stage of the Louvain algorithm as the basis for seed nodes selection. We choose actual co-authorship network dataset, select a variety of evaluation indicators to assess the division results, and visualize the network structure by using appropriate layout algorithm. Experiments show that our algorithm can find the academic communities better, and the results are more legitimate.