Overlapping community detection in networks based on link partitioning and partitioning around medoids.

Autor: Ponomarenko A; HSE University, Nizhny Novgorod, Russia., Pitsoulis L; University of Thessaloniki, Thessaloniki, Greece., Shamshetdinov M; HSE University, Nizhny Novgorod, Russia.
Jazyk: angličtina
Zdroj: PloS one [PLoS One] 2021 Aug 25; Vol. 16 (8), pp. e0255717. Date of Electronic Publication: 2021 Aug 25 (Print Publication: 2021).
DOI: 10.1371/journal.pone.0255717
Abstrakt: In this paper, we present a new method for detecting overlapping communities in networks with a predefined number of clusters called LPAM (Link Partitioning Around Medoids). The overlapping communities in the graph are obtained by detecting the disjoint communities in the associated line graph employing link partitioning and partitioning around medoids which are done through the use of a distance function defined on the set of nodes. We consider both the commute distance and amplified commute distance as distance functions. The performance of the LPAM method is evaluated with computational experiments on real life instances, as well as synthetic network benchmarks. For small and medium-size networks, the exact solution was found, while for large networks we found solutions with a heuristic version of the LPAM method.
Competing Interests: The authors have declared that no competing interests exist.
Databáze: MEDLINE
Externí odkaz:
Nepřihlášeným uživatelům se plný text nezobrazuje