Experiments on Graph Clustering Algorithms

A promising approach to graph clustering is based on the intuitive notion of intra-cluster density vs. inter-cluster sparsity. While both formalizations and algorithms focusing on particular aspects of this rather vague concept have been proposed no conclusive argument on their appropriateness has been given. As a first step towards understanding the consequences of particular conceptions, we conducted an experimental evaluation of graph clustering approaches. By combining proven techniques from graph partitioning and geometric clustering, we also introduce a new approach that compares favorably.

• Type: Conference
• Year: 2003
• Where: ESA
• Authors: Ulrik Brandes, Marco Gaertler, Dorothea Wagner
• Keywords: ESA 2003, Graph Clustering Approaches, Intra-cluster Density Vs, Promising Approach