OVERLAPPING COMMUNITY DETECTION ALGORITHMS USING MODULARITY AND THE COSINE
DUY HIEU DO, THI HA DUONG PHAN
Source record
Source: Crossref
Published: Feb 28, 2025
DOI: 10.1142/s0219525925500067
Open original source ↗Source abstract
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.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.