Rough-Set-Based Real-Time Interest Label Extraction over Large-Scale Social Networks

Algorithm 2

Algorithm for dividing upper and lower approximations of subgraph based on the central node named .

	Input: candidate user list named and subgraph list named .
	Output: divide each user into a subgraph.
(1)	for do
(2)	for do
(3)	Calculate the degree of membership from to each subgraph ;
(4)	Find the maximum membership degree between and the subgraph, and store the subgraph number and membership degree of the current maximum membership degree into and respectively;
(5)	end
(6)	;
(7)	for do
(8)	if then
(9)
(10)	else
(11)	;
(12)	end
(13)	end
(14)	if  then
(15)	;
(16)	for do
(17)	;
(18)	end
(19)	end
(20)	end
(21)	return