| Naslov: | How should we benchmark community detection algorithms in complex networks? |
|---|
| Avtorji: | ID Pritržnik, Robi (Avtor) |
| Datoteke: | RAZ_Pritrznik_Robi_2025.pdf (12,52 MB) MD5: 2EBEEB33F12E23AE224DC803CB606675
|
|---|
| Jezik: | Angleški jezik |
|---|
| Vrsta gradiva: | Neznano |
|---|
| Tipologija: | 1.08 - Objavljeni znanstveni prispevek na konferenci |
|---|
| Organizacija: | FIŠ - Fakulteta za informacijske študije v Novem mestu
|
|---|
| Opis: | In this article we discuss how should we benchmark community detection algorithms in complex networks. We compare the community detection algorithms Louvain, Leiden, Label Propagation, Fast Label Propagation, Greedy modularity, Infomap, Walktrap and Girvan-Newman on complex networks of the Zachary karate club, Synthetic Network, a social network from X (Twitter), a neuroscience network, a email network and a patent citation network in the USA. We find that the speed of algorithms depends on the size and structure of networks. It turns out that among the considered algorithms for community detection in large networks, the Leiden algorithm is the most suitable, while on average the Fast Label Propagation algorithm performed the fastest in all cases. It is shown that on LFR benchmark network, algorithms successfully detect the same number of communities, however when we apply the same algorithms on complex networks the results are variable based on specific algorithm. |
|---|
| Ključne besede: | community detection, networks and graphs, network analysis, complex networks |
|---|
| Status publikacije: | Objavljeno |
|---|
| Verzija publikacije: | Objavljena publikacija |
|---|
| Datum objave: | 16.01.2026 |
|---|
| Leto izida: | 2025 |
|---|
| Št. strani: | Str. [88-97] |
|---|
| PID: | 20.500.12556/ReVIS-13041  |
|---|
| UDK: | 004.8:519.17 |
|---|
| COBISS.SI-ID: | 264969219  |
|---|
| Opomba: | Nasl. z nasl. zaslona;
Opis vira z dne 16. 1. 2026;
|
|---|
| Datum objave v ReVIS: | 22.01.2026 |
|---|
| Število ogledov: | 34 |
|---|
| Število prenosov: | 0 |
|---|
| Metapodatki: |  |
|---|
|
:
|
Kopiraj citat |
|---|
| | | | Objavi na: |  |
|---|
Postavite miškin kazalec na naslov za izpis povzetka. Klik na naslov izpiše
podrobnosti ali sproži prenos. |