The content discusses the challenges of community detection in networks with overlapping nodes. Two algorithms are proposed: Parameterized Modularity Overlap Algorithm and Module Overlap Algorithm. Experiments on real data and random graphs demonstrate the effectiveness of these algorithms in identifying overlapping communities.
The Parameterized Modularity Overlap Algorithm focuses on identifying overlapping communities based on a threshold parameter, while the Module Overlap Algorithm aims to increase modularity step by step. The experiments show promising results in detecting overlapping communities in various network structures.
Key metrics such as modularity values and ONMI scores are used to evaluate the performance of the algorithms across different datasets. The experiments highlight the importance of considering overlap in community detection for more accurate results.
To Another Language
from source content
arxiv.org
Key Insights Distilled From
by Do Duy Hieu,... at arxiv.org 03-14-2024
https://arxiv.org/pdf/2403.08000.pdfDeeper Inquiries