A Partitioning-based divisive clustering technique for maximizing the modularity - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Book Sections Year : 2013

A Partitioning-based divisive clustering technique for maximizing the modularity

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.
Fichier principal
Vignette du fichier
divisiveClustering.pdf (319.68 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00763559 , version 1 (20-12-2019)

Identifiers

Cite

Umit V. Catalyurek, Kamer Kaya, Johannes Langguth, Bora Uçar. A Partitioning-based divisive clustering technique for maximizing the modularity. D. A. Bader and H. Meyerhenke and P. Sanders and D. Wagner. Graph Partitioning and Graph Clustering 2012, 588, AMS, pp.171--186, 2013, Contemporary Mathematics, ⟨10.1090/conm/588/11712⟩. ⟨hal-00763559⟩
169 View
171 Download

Altmetric

Share

Gmail Facebook X LinkedIn More