- Scalable Discovery of Best Clusters on Large Graphs, VLDB 2010
- Weighted: yes
- Directed: yes
- Scalable: yes
- Overlap: yes

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 (Article 0) #

# Suggested Pages #

- 0.428 Coarse graining
- 0.171 Community structure
- 0.050 Community detectability
- 0.047 Dynamic community structure
- 0.038 Animal social network
- 0.032 Community evolution
- 0.030 Block model
- 0.027 Community
- 0.024 Temporal community structure
- 0.023 Cluster validation
- More suggestions...