Name
Abstract | ||
|---|---|---|
We present a new graph clustering algorithm aimed at obtaining clusterings of high modularity. The algorithm pursues a divisive clustering approach and uses established graph partitioning algorithms and techniques to compute recursive bipartitions of the input as well as to refine clusters. Experimental evaluation shows that the modularity scores obtained compare favorably to many previous approaches. In the majority of test cases, the algorithm outperformed the best known alternatives. In particular, among 13 problem instances common in the literature, the proposed algorithm improves the best known modularity in 9 cases. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1090/conm/588/11712 | GRAPH PARTITIONING AND GRAPH CLUSTERING |
Keywords | DocType | Volume |
Clustering, modularity, graphs, hypergraphs | Conference | 588 |
ISSN | Citations | PageRank |
0271-4132 | 2 | 0.36 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ümit V. Çatalyürek | 1 | 1063 | 83.19 |
| Kamer Kaya | 2 | 447 | 42.40 |
| Johannes Langguth | 3 | 85 | 12.71 |
| Bora Uçar | 4 | 420 | 29.21 |