Department of Mathematics
 Search | Help | Login | pdf version | printable version

Math @ Duke



Publications [#264725] of Guillermo Sapiro

Papers Published

  1. Tepper, M; Sapiro, G, Ants crawling to discover the community structure in networks, Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8259 LNCS no. PART 2 (December, 2013), pp. 552-559, Springer Berlin Heidelberg, ISSN 0302-9743 [doi]
    (last updated on 2019/06/20)

    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.
ph: 919.660.2800
fax: 919.660.2821

Mathematics Department
Duke University, Box 90320
Durham, NC 27708-0320