Improving the performance of algorithms to find communities in networks
Loading...
Access rights
openAccess
publishedVersion
URL
Journal Title
Journal ISSN
Volume Title
A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä
This publication is imported from Aalto University research portal.
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Authors
Date
2014
Department
Major/Subject
Mcode
Degree programme
Language
en
Pages
Series
Physical Review E, Volume 89, issue 3, pp. 1-7
Abstract
Most algorithms to detect communities in networks typically work without any information on the cluster structure to be found, as one has no a priori knowledge of it, in general. Not surprisingly, knowing some features of the unknown partition could help its identification, yielding an improvement of the performance of the method. Here we show that, if the number of clusters was known beforehand, standard methods, like modularity optimization, would considerably gain in accuracy, mitigating the severe resolution bias that undermines the reliability of the results of the original unconstrained version. The number of clusters can be inferred from the spectra of the recently introduced nonbacktracking and flow matrices, even in benchmark graphs with realistic community structure. The limit of such a two-step procedure is the overhead of the computation of the spectra.Description
Keywords
Other note
Citation
Darst, R K, Nussinov, Z & Fortunato, S 2014, ' Improving the performance of algorithms to find communities in networks ', Physical Review E, vol. 89, no. 3, 032809, pp. 1-7 . https://doi.org/10.1103/PhysRevE.89.032809