A high resolution clique-based overlapping community detection algorithm for small-world networks

In this paper we propose a clique-based high-resolution overlapping community detection algorithm. The hub percolation method is able to find a large number of highly overlapping communities. Using different hub-selection strategies and parametrization we are able to fine tune the resolution of the...

Teljes leírás

Elmentve itt :
Bibliográfiai részletek
Szerzők: Bóta András
Krész Miklós
Dokumentumtípus: Cikk
Megjelent: 2015
Sorozat:INFORMATICA-JOURNAL OF COMPUTING AND INFORMATICS 39 No. 2
Tárgyszavak:
mtmt:2925980
Online Access:http://publicatio.bibl.u-szeged.hu/26065
Leíró adatok
Tartalmi kivonat:In this paper we propose a clique-based high-resolution overlapping community detection algorithm. The hub percolation method is able to find a large number of highly overlapping communities. Using different hub-selection strategies and parametrization we are able to fine tune the resolution of the algorithm. We also propose a weighted hub-selection strategy, allowing the algorithm to handle weighted networks in a natural way, without additional filtering. We will evaluate our method on various benchmarks, and we will also demonstrate the usefulness of our algorithm on a real-life economic case-study.
Terjedelem/Fizikai jellemzők:177-187
ISSN:0350-5596