English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/81631
Share/Impact:
Statistics
logo share SHARE logo core CORE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:

Title

Exploring the limits of community detection strategies in complex networks

AuthorsAldecoa, Rodrigo ; Marín, Ignacio
Issue Date17-Jul-2013
PublisherNature Publishing Group
CitationScientific Reports 3: 2216 (2013)
AbstractThe characterization of network community structure has profound implications in several scientific areas. Therefore, testing the algorithms developed to establish the optimal division of a network into communities is a fundamental problem in the field. We performed here a highly detailed evaluation of community detection algorithms, which has two main novelties: 1) using complex closed benchmarks, which provide precise ways to assess whether the solutions generated by the algorithms are optimal; and, 2) A novel type of analysis, based on hierarchically clustering the solutions suggested by multiple community detection algorithms, which allows to easily visualize how different are those solutions. Surprise, a global parameter that evaluates the quality of a partition, confirms the power of these analyses. We show that none of the community detection algorithms tested provide consistently optimal results in all networks and that Surprise maximization, obtained by combining multiple algorithms, obtains quasi-optimal performances in these difficult benchmarks.
Description11 páginas, 8 figuras, 1 tabla.
Publisher version (URL)http://dx.doi.org/10.1038/srep02216
URIhttp://hdl.handle.net/10261/81631
DOI10.1038/srep02216
E-ISSN2045-2322
Appears in Collections:(IBV) Artículos
Files in This Item:
File Description SizeFormat 
2013 Scientific Reports 003-02216.pdf1,93 MBAdobe PDFThumbnail
View/Open
Show full item record
Review this work
 

Related articles:


WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.