A fast multilevel algorithm for graph clustering and community detection

Details A fast multilevel algorithm for graph clustering and community detection A fast multilevel algorithm for graph clustering and community detection

2007-07-16

arxiv.org/abs/0707.2387v1

Physics

Data Analysis, Statistics and Probability

12 pages, 2 figures; Workshop on Algorithms and Models for the Web Graph, 2006

Scientific paper

One of the most useful measures of cluster quality is the modularity of a partition, which measures the difference between the number of the edges joining vertices from the same cluster and the expected number of such edges in a random (unstructured) graph. In this paper we show that the problem of finding a partition maximizing the modularity of a given graph G can be reduced to a minimum weighted cut problem on a complete graph with the same vertices as G. We then show that the resulted minimum cut problem can be efficiently solved with existing software for graph partitioning and that our algorithm finds clusterings of a better quality and much faster than the existing clustering algorithms.

Affiliated with

Also associated with

No associations

Rating

A fast multilevel algorithm for graph clustering and community detection does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A fast multilevel algorithm for graph clustering and community detection, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A fast multilevel algorithm for graph clustering and community detection will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-561753