×
In this paper, we introduce an algorithm for overlapping community detection based on granular information of links and concepts of rough set theory.
An overlapping community detection algorithm based on rough clustering of links. Samrat Gupta and Pradeep Kumar. Journal Articles | Data and Knowledge ...
First, neighborhood links around each pair of nodes are utilized to form initial link subsets. Subsequently, constrained linkage upper approximation of the link ...
People also ask
In this paper, we introduce an algorithm for overlapping community detection based on granular information of links and concepts of rough set theory. First, ...
Oct 22, 2024 · This paper proposes a novel algorithm to discover overlapping communities. Different from conventional algorithms based on node clustering, the ...
Gupta and P. Kumar: An overlapping community detection algorithm based on rough clustering of links. Data Knowl. Engrg. 125 (2020), 101777.
An algorithm (CLCD) to detect high overlapping community structures by selecting a core link and attracting links in the outer space to join in the ...
Jun 18, 2024 · Our research introduces a novel rough clustering based consensus community framework (RC-CCD) for effective structure identification of network communities.
This paper proposes an algorithm (CLCD) to detect high overlapping community structures. This algorithm starts from the perspective of the link. Through ...
Dec 22, 2022 · Non-overlapping link clustering is used in this paper to achieve overlapping node clustering when all links of a node belong to one cluster.