Community detection by using the extended modularity

This article is about community detection algorithms in graphs. First a new method will be introduced, which is based on an extension [16] of the commonly used modularity [17, 18, 19, 20] and gives overlapping communities. We list and compare the results given by our new method and some other algori...

Full description

Saved in:
Bibliographic Details
Main Authors: Griechisch Erika
Pluhár András
Corporate Author: Conference for PhD Students in Computer Science (7.) (2010) (Szeged)
Format: Article
Published: 2011
Series:Acta cybernetica 20 No. 1
Kulcsszavak:Számítástechnika, Kibernetika
Subjects:
doi:10.14232/actacyb.20.1.2011.6

Online Access:http://acta.bibl.u-szeged.hu/12899
Description
Summary:This article is about community detection algorithms in graphs. First a new method will be introduced, which is based on an extension [16] of the commonly used modularity [17, 18, 19, 20] and gives overlapping communities. We list and compare the results given by our new method and some other algorithms yielding either overlapping or non-overlapping communities. While the main use of the proposed algorithm is benchmarking, we also consider the possibility of hot starts, and some further extensions that considers the degree distribution of the graphs.
Physical Description:69-85
ISSN:0324-721X