Ants crawling to discover the community structure in networks

We cast the problem of discovering the community structure in networks as the composition of community candidates, obtained from several community detection base algorithms, into a coherent structure. In turn, this composition can be cast into a maximum-weight clique problem, and we propose an ant colony optimization algorithm to solve it. Our results show that the proposed method is able to discover better community structures, according to several evaluation criteria, than the ones obtained with the base algorithms. It also outperforms, both in quality and in speed, the recently introduced FG-Tiling algorithm. © Springer-Verlag 2013.

Full Text

Duke Authors

Cited Authors

  • Tepper, M; Sapiro, GR

Published Date

  • December 1, 2013

Published In

Volume / Issue

  • 8259 LNCS / PART 2

Start / End Page

  • 552 - 559

Electronic International Standard Serial Number (EISSN)

  • 1611-3349

International Standard Serial Number (ISSN)

  • 0302-9743

Digital Object Identifier (DOI)

  • 10.1007/978-3-642-41827-3_69

Citation Source

  • Scopus