“Follow the Leader”: A Centrality Guided Clustering and Its Application to Social Network Analysis

Algorithm 1

CGC algorithm.

Input: a weighted graph 𝐺.

Output: clustering dendrogram of the graph 𝐺.

(Initialization) 𝑙=1,𝐺_𝑙=𝐺,

while 𝑉(𝐺_𝑙)>1

 (GROUPING) Cluster the vertices in 𝐺_𝑙 into different groups.

 (MERGING) Merge those groups with large percentage of overlap.

 (CONTRACTION) Contract those vertices in the same groups to a new vertex,

 calculate the edge weights in the contracted graph.

 Denote the contracted graph as 𝐺_𝑙+1, 𝑙=𝑙+1.