Engineering Comparators for Graph Clusterings

A promising approach to compare two graph clusterings is based on using measurements for calculating the distance between them. Existing measures either use the structure of clusterings or quality-based aspects with respect to some index evaluating both clusterings. Each approach suffers from conceptional drawbacks. We introduce a new approach combining both aspects and leading to better results for comparing graph clusterings. An experimental evaluation of existing and new measures shows that the significant drawbacks of existing techniques are not only theoretical in nature but manifest frequently on different types of graphs. The evaluation also proves that the results of our new measures are highly coherent with intuition, while avoiding the former weaknesses.

• Type: Conference
• Year: 2008
• Where: AAIM
• Authors: Daniel Delling, Marco Gaertler, Robert Görke, Dorothea Wagner
• Keywords: AAIM 2008, Algorithms, Graph Clusterings, Promising Approach, Quality-based Aspects