Performance Evaluation of Modularity Based Community Detection Algorithms in Large Scale Networks

Vinícius da Fonseca Vieira, Carolina Ribeiro Xavier, Nelson Francisco Favilla Ebecken and Alexandre Gonçalves Evsukoff

Mathematical Problems in Engineering, 2014, vol. 2014, 1-15

Abstract:

Community structure detection is one of the major research areas of network science and it is particularly useful for large real networks applications. This work presents a deep study of the most discussed algorithms for community detection based on modularity measure: Newman’s spectral method using a fine-tuning stage and the method of Clauset, Newman, and Moore (CNM) with its variants. The computational complexity of the algorithms is analysed for the development of a high performance code to accelerate the execution of these algorithms without compromising the quality of the results, according to the modularity measure. The implemented code allows the generation of partitions with modularity values consistent with the literature and it overcomes 1 million nodes with Newman’s spectral method. The code was applied to a wide range of real networks and the performances of the algorithms are evaluated.

Date: 2014
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2014/502809.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2014/502809.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:502809

DOI: 10.1155/2014/502809

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().