Clustering analysis of a weighted graph

Question

My data consists of a large weighted undirected graph of $n$ nodes. I need to group the nodes into $m$ clusters ($m < n$), such that nodes in a cluster are connected with heavy weights. What algorithms are available for this problem?

Answer 1

Some keywords and starting references:

• Spectral clustering
• Community detection

Answer 2

Walktrap and the Louvain algorithms work very well with weighted undirected graphs.

You may find them in most modern graph libraries.