Semantic Scholar Open Access 2008 1287 sitasi

On Modularity Clustering

U. Brandes Daniel Delling M. Gaertler Robert Görke M. Hoefer +2 lainnya

Lihat Sumber DOI

Abstrak

Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines, particularly in the complex systems literature, although its properties are not well understood. We study the problem of finding clusterings with maximum modularity, thus providing theoretical foundations for past and present work based on this measure. More precisely, we prove the conjectured hardness of maximizing modularity both in the general case and with the restriction to cuts and give an Integer Linear Programming formulation. This is complemented by first insights into the behavior and performance of the commonly applied greedy agglomerative approach.

Topik & Kata Kunci

Computer Science

Penulis (7)

U. Brandes

Daniel Delling

M. Gaertler

Robert Görke

M. Hoefer

Z. Nikoloski

D. Wagner

Format Sitasi

APA MLA BibTeX

Brandes, U., Delling, D., Gaertler, M., Görke, R., Hoefer, M., Nikoloski, Z. et al. (2008). On Modularity Clustering. https://doi.org/10.1109/TKDE.2007.190689

Akses Cepat

Lihat di Sumber doi.org/10.1109/TKDE.2007.190689

Informasi Jurnal

Tahun Terbit: 2008
Bahasa: en
Total Sitasi: 1287×
Sumber Database: Semantic Scholar
DOI: 10.1109/TKDE.2007.190689
Akses: Open Access ✓