Modularity Maximization Adjusted by Neural Networks

Graphs are combinatorial structures suitable for modelling various real systems. The high clustering tendency observed in many of these graphs has led a large number of researches, among them, we point out the modularity maximization-based community detection algorithms. Although very effective a fe...

Full description

Saved in:
Bibliographic Details
Published inNeural Information Processing pp. 287 - 294
Main Authors Carvalho, Desiree Maldonado, Resende, Hugo, Nascimento, Mariá C. V.
Format Book Chapter
LanguageEnglish
Published Cham Springer International Publishing 2014
SeriesLecture Notes in Computer Science
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:Graphs are combinatorial structures suitable for modelling various real systems. The high clustering tendency observed in many of these graphs has led a large number of researches, among them, we point out the modularity maximization-based community detection algorithms. Although very effective a few studies suggest that, for some networks, this approach does not find the expected communities due to a resolution limit of the measure. In this paper, we propose a way to automatically choose the value of the resolution parameter considered in the modularity by using neural networks. In the computational experiments, we observed that the proposed strategy outperformed another strategies from the literature for hundreds of artificial graphs considering the expected communities.
ISBN:3319126369
9783319126364
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-319-12637-1_36