|
This article is cited in 2 scientific papers (total in 2 papers)
Parallel modularity computation for directed weighted graphs with overlapping communities
Mikhail Drobyshevskiya, Anton Korshunova, Denis Turdakovabc a Institute for System Programming of the Russian Academy of Sciences
b National Research University "Higher School of Economics" (HSE)
c Lomonosov Moscow State University
Abstract:
The paper presents new versions of modularity measure for directed weighted graphs with overlapping communities. We consider several approaches to computing modularity and try to extend them. Taking into account computational complexity, we suggest two parallelized extensions which are scalable to large graphs (more than $10^4$ nodes).
Keywords:
modularity, community detection, PageRank, LinkRank, belonging function, belonging coefficient.
Citation:
Mikhail Drobyshevskiy, Anton Korshunov, Denis Turdakov, “Parallel modularity computation for directed weighted graphs with overlapping communities”, Proceedings of ISP RAS, 28:6 (2016), 153–170
Linking options:
https://www.mathnet.ru/eng/tisp91 https://www.mathnet.ru/eng/tisp/v28/i6/p153
|
|