Community Detection Algorithm Based on Intelligent Calculation of Complex Network Nodes

Algorithm 1

The pseudocode of the clustering algorithm.

	Input: an undirected weighted graph containing attributes G, Number of clusters;
	Output: get a category ;
	Step 1: initialize the distance of each node in the graph
	Step 2: cluster center point , Semantic extremum , Balance factor
	Step 3: each node included in the set of all nodes in the For graph
	Step 4: each node contained in the set of all nodes in the For graph
	Step 5: calculate the proximity of nodes according to formula (8)
	Step 6: calculate the node distance according to formula (8)