Social Network Community Detection Using Agglomerative Spectral Clustering

Pseudocode 1

Input: Graph , Nodes , Edges , density

parameter

Output: Hierarchically clustered communities

Find the eigenvectors

of

Find the similarities of each node i and j

using eigenvectors with Eq. (5)

Compute the most similar node i using

Eq. (7)

Agglomerate the node i and j if the two

nodes chose each other as the most

similar node

Re-initialize the graph with the

agglomerated nodes and start the next

iteration

Agglomerate the nodes into hierarchical

clusters when the iteration is finished