Study on Discovery Method of Cooperative Research Team Based on Improved Louvain Algorithm

Algorithm 2

Louvain-LSCR.

	Input: the adjacency matrix of the
	Output: the result of community detection on
	Step 1: initialize the network and assign each node to different communities.
	Step 2: the leaf nodes in the network are pruned, and then execute stage1.
	Step 3: compress each community obtained in stage 1 into a super point, and construct a new network graph , and then obtain the LSCR value of the node according to Algorithm 1 in , and then select the seed node according to formula (8).
	Step 4: for non-seed node , divide it according to the principle described above.
	Step 5: repeat Step 4 until all the non-seed nodes in belong to the community no longer change.
	Step 6: output the community detection result , and the algorithm ends.