Bootstrap clustering for graph partitioning


Given a simple undirected weighted or unweighted graph, we try to cluster the vertex set into communities and also to quantify the robustness of these clusters. For that task, we propose a new method, called bootstrap clustering which consists in (i) defining a new clustering algorithm for graphs, (ii) building a set of graphs similar to the initial one… (More)
DOI: 10.1051/ro/2012001


6 Figures and Tables

Slides referencing similar topics