Community detection by using the extended modularity

Griechisch, Erika and Pluhár, András: Community detection by using the extended modularity. Acta cybernetica, (20) 1. pp. 69-85. (2011)

[img] Cikk, tanulmány, mű
actacyb_20_1_2011_6.pdf

Download (1MB)

Abstract

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.

Item Type: Article
Event Title: Conference for PhD Students in Computer Science, 7., 2010, Szeged
Journal or Publication Title: Acta cybernetica
Date: 2011
Volume: 20
Number: 1
Page Range: pp. 69-85
ISSN: 0324-721X
Language: angol
DOI: https://doi.org/10.14232/actacyb.20.1.2011.6
Uncontrolled Keywords: Természettudomány, Informatika
Additional Information: Bibliogr.: p. 83-85.; Abstract
Date Deposited: 2016. Oct. 15. 12:24
Last Modified: 2018. Jun. 05. 13:49
URI: http://acta.bibl.u-szeged.hu/id/eprint/12899

Actions (login required)

View Item View Item