2024/03/12 by Do Duy Hieu, Hieu, Do Duy, Phan Thi Ha Duong +1
Physics and Astronomy · #Community detection #Complex Network Analysis Techniques #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Social and Information Networks (cs.SI)
paper · pdf · doi:10.48550/arxiv.2403.08000
openalex publication_date 2024/03/12 · openalex created_date 2024/03/15 · openalex updated_date 2026/07/28
The issue of network community detection has been extensively studied across many fields. Most community detection methods assume that nodes belong to only one community. However, in many cases, nodes can belong to multiple communities simultaneously.This paper presents two overlapping network community detection algorithms that build on the two-step approach, using the extended modularity and cosine function. The applicability of our algorithms extends to both undirected and directed graph structures. To demonstrate the feasibility and effectiveness of these algorithms, we conducted experiments using real data.