Skip to content

TopGC #
Find similar titles

This algorithm aims to find the 'top clusters' not finding all clusters in the graph. It uses Locality-sensitive hashing. The quality measure is defined as "the average link weight between all nodes in the cluster (including links with weight 0) multiplied by the square root of the cluster size (to allow for a bias towards larger cluster sizes)."

$$ Q_c = \sqrt{|c|} \frac{\sum_{i,j \in c} w_{ij}}{|c| (|c|-1)} $$

Incoming Links #

Related Articles #

Suggested Pages #