Optimizing Information Dissemination Model for Improvement of College Students’ Education Based on Learning Community

Algorithm 3

Improved K-means algorithm.

	Take the users with high PR value obtained above as the initial clustering center point set and mark it as X
	While the center user changes do
	for (i to 100)do
	for (each j X) do
	Compare the size of D(i,j)
	end
	if (D(i,j) is the smallest)
	i belongs to j^th class
	End
	Update the result with the largest PR value of each category in this clustering result as the central user
	End