Table 1.

The following leader cluster algorithm (FLCA) used in this study (Searching leaders).

Input k, Sorting dataset A (name, connections, cluster#)
And B(couple names and connections) by
descending order and cluster#(1至n) assigned each
Output for temporary clusters
1	Followers search leaders from lower to higher in connections by observing the maximum as the leader
2	For jk = n To 1 Step -1 for DatasetA(size = n)
3	Entity = dataset A. Cells(jk, 1)
4	For j = 1 To m datasetB(size = m)
5	Name 1 = dataset B. Cells(j, 4)
6	Name 2 = dataset B. Cells(j, 5)
7	connections = dataset B. Cells(j, 6)
8	If Entity = Name1 Or Entity = Name 2
	And Name 1 <>Name 2 Then
9	If Entity = Name 1Then
10	Leader = Name 2
11	Else
12	Leader = Name 1
13	End If
14	For jk2 = 1 To jk—1
	(Counts for leader > counts for follower)
15	□□If datasetA. Cells(jk2, 1) = leader Then
16	□Dataset A. Cells(jk, 3) = jk2
17	□(leader found)
18	□□□□□□Goto 22 end the loopjk2及j
19	□□□End If
20	□□□Next jk2□end dataset A
21	□Next J□□end dataset B(size = m)
22	Next jk□□end dataset A(size = n)