A High Resolution Clique-based Overlapping Community Detection Algorithm for Small-world Networks

Abstract

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.

Authors

  • András Bóta
  • Miklós Krész

Downloads

How to Cite

Bóta, A., & Krész, M. (2015). A High Resolution Clique-based Overlapping Community Detection Algorithm for Small-world Networks. Informatica, 39(2). Retrieved from https://www.informatica.si/index.php/informatica/article/view/834

Issue

Vol. 39 No. 2 (2015)

Section

Regular papers

License

Authors retain copyright in their work. By submitting to and publishing with Informatica, authors grant the publisher (Slovene Society Informatika) the non-exclusive right to publish, reproduce, and distribute the article and to identify itself as the original publisher.

All articles are published under the Creative Commons Attribution license CC BY 3.0. Under this license, others may share and adapt the work for any purpose, provided appropriate credit is given and changes (if any) are indicated.

Authors may deposit and share the submitted version, accepted manuscript, and published version, provided the original publication in Informatica is properly cited.