Petr Prokop
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Petr Prokop has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Jan Platos
VŠB Technical University of Ostrava
2 shared publications - Pavla Dráždilová
VSB - Technical University of Ostrava
2 shared publications Jan Platoš
Department of Computer Science, FEECS, VSB - Technical University of Ostrava, Ostrava, Czech Republic
1 shared publicationPavla Dráždilová
Department of Computer Science, FEECS, VSB - Technical University of Ostrava, Ostrava, Czech Republic
1 shared publication- Vaclav Snasel
VŚB-Technical University of Ostrava
1 shared publication
Latest Publications
- Open Access
- 28 October 2024
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 19 (10) , e0312596
Overlapping community detection in weighted networks via hierarchical clustering
In real-world networks, community structures often appear as tightly connected clusters of nodes, with recent studies suggesting a hierarchical organization where larger groups subdivide into smaller ones across different levels. This hierarchical structure is particularly complex in trade networks, where actors typically belong to multiple communities due to diverse business relationships and contracts. To address this complexity, we present a novel algorithm for detecting hierarchical structures of overlapping communities in weighted networks, focusing on the interdependency between internal and external quality metrics for evaluating the detected communities. The proposed Graph Hierarchical Agglomerative Clustering (GHAC) approach utilizes maximal cliques as the basis units for hierarchical clustering. The algorithm measures dissimilarities between clusters using the minimal closed trail distance (CT−distance) and the size of maximal cliques within overlaps, capturing the density and connectivity of nodes. Through extensive experiments on synthetic networks with known ground truth, we demonstrate that the adjusted Silhouette index is the most reliable internal metric for determining the optimal cut in the dendrogram. Experimental results indicate that the GHAC method is competitive with widely used community detection techniques, particularly in networks with highly overlapping communities. The method effectively reveals the hierarchical structure of communities in weighted networks, as demonstrated by its application to the OECD weighted trade network, which describes the balanced trade value of bilateral trade relations.
- 28 October 2024
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 19 (10) , e0312596
Open AccessOverlapping community detection in weighted networks via hierarchical clustering
In real-world networks, community structures often appear as tightly connected clusters of nodes, with recent studies suggesting a hierarchical organization where larger groups subdivide into smaller ones across different levels. This hierarchical structure is particularly complex in trade networks, where actors typically belong to multiple communities due to diverse business relationships and contracts. To address this complexity, we present a novel algorithm for detecting hierarchical structures of overlapping communities in weighted networks, focusing on the interdependency between internal and external quality metrics for evaluating the detected communities. The proposed Graph Hierarchical Agglomerative Clustering (GHAC) approach utilizes maximal cliques as the basis units for hierarchical clustering. The algorithm measures dissimilarities between clusters using the minimal closed trail distance (CT−distance) and the size of maximal cliques within overlaps, capturing the density and connectivity of nodes. Through extensive experiments on synthetic networks with known ground truth, we demonstrate that the adjusted Silhouette index is the most reliable internal metric for determining the optimal cut in the dendrogram. Experimental results indicate that the GHAC method is competitive with widely used community detection techniques, particularly in networks with highly overlapping communities. The method effectively reveals the hierarchical structure of communities in weighted networks, as demonstrated by its application to the OECD weighted trade network, which describes the balanced trade value of bilateral trade relations.
- 29 February 2024
- Published by Springer Nature
- p. 159-171
Hierarchical Overlapping Community Detection for Weighted Networks
- 29 February 2024
- Published by Springer Nature
- p. 159-171
Hierarchical Overlapping Community Detection for Weighted Networks
- Open Access
- 5 February 2024
- Published by Elsevier in Information Sciences
- Vol. 662, 120271
A hierarchical overlapping community detection method based on closed trail distance and maximal cliques
- 5 February 2024
- Published by Elsevier in Information Sciences
- Vol. 662, 120271
Open AccessA hierarchical overlapping community detection method based on closed trail distance and maximal cliques