scholarly journals Overlapping community detection algorithm based on similarity of node relationship

Author(s):  
Hongtao Liu ◽  
Ning Wang

Abstract Community discovery is a vital link in the research of social networks. Aiming at the shortcomings of the current local extension-based community discovery algorithm in local community discovery and extension, we propose a based on relationship similarity and local extension Overlapping community detection algorithm(RSLO). First, use the node's relationship similarity strategy to find close seed communities. Then, according to the discovered seed community, the similarity between the neighbor nodes of the community and the community is calculated, and the nodes whose similarity meets the threshold are selected. After that, an adaptive optimization function is used to expand the community. Finally, the free nodes that have not been divided into the community are divided into communities, thereby achieving a more comprehensive community discovery. We conduct experiments on classic datasets and artificially generated networks. The results show that the RSLO algorithm can find accurate and objective community structures.

Entropy ◽  
2021 ◽  
Vol 23 (6) ◽  
pp. 680
Author(s):  
Hanyang Lin ◽  
Yongzhao Zhan ◽  
Zizheng Zhao ◽  
Yuzhong Chen ◽  
Chen Dong

There is a wealth of information in real-world social networks. In addition to the topology information, the vertices or edges of a social network often have attributes, with many of the overlapping vertices belonging to several communities simultaneously. It is challenging to fully utilize the additional attribute information to detect overlapping communities. In this paper, we first propose an overlapping community detection algorithm based on an augmented attribute graph. An improved weight adjustment strategy for attributes is embedded in the algorithm to help detect overlapping communities more accurately. Second, we enhance the algorithm to automatically determine the number of communities by a node-density-based fuzzy k-medoids process. Extensive experiments on both synthetic and real-world datasets demonstrate that the proposed algorithms can effectively detect overlapping communities with fewer parameters compared to the baseline methods.


2019 ◽  
Vol 33 (30) ◽  
pp. 1992001
Author(s):  
Guishen Wang ◽  
Yuanwei Wang ◽  
Kaitai Wang ◽  
Zhihua Liu ◽  
Lijuan Zhang ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document