A two-stage BFS local community detection algorithm based on node transfer similarity and Local Clustering Coefficient

2020 ◽  
Vol 537 ◽  
pp. 122717 ◽  
Author(s):  
Saisai Liu ◽  
Zhengyou Xia
2021 ◽  
Vol 12 ◽  
Author(s):  
Yan Wang ◽  
Chen Qiong ◽  
Lili Yang ◽  
Sen Yang ◽  
Kai He ◽  
...  

With the rapid development of bioinformatics, researchers have applied community detection algorithms to detect functional modules in protein-protein interaction (PPI) networks that can predict the function of unknown proteins at the molecular level and further reveal the regularity of cell activity. Clusters in a PPI network may overlap where a protein is involved in multiple functional modules. To identify overlapping structures in protein functional modules, this paper proposes a novel overlapping community detection algorithm based on the neighboring local clustering coefficient (NLC). The contributions of the NLC algorithm are threefold: (i) Combine the edge-based community detection method with local expansion in seed selection and the local clustering coefficient of neighboring nodes to improve the accuracy of seed selection; (ii) A method of measuring the distance between edges is improved to make the result of community division more accurate; (iii) A community optimization strategy for the excessive overlapping nodes makes the overlapping structure more reasonable. The experimental results on standard networks, Lancichinetti-Fortunato-Radicchi (LFR) benchmark networks and PPI networks show that the NLC algorithm can improve the Extended modularity (EQ) value and Normalized Mutual Information (NMI) value of the community division, which verifies that the algorithm can not only detect reasonable communities but also identify overlapping structures in networks.


2021 ◽  
Author(s):  
Zhikang Tang ◽  
Yong Tang ◽  
Chunying Li ◽  
Jinli Cao ◽  
Guohua Chen ◽  
...  

2016 ◽  
Vol 2016 ◽  
pp. 1-11 ◽  
Author(s):  
Yong Zhou ◽  
Guibin Sun ◽  
Yan Xing ◽  
Ranran Zhou ◽  
Zhixiao Wang

In order to discover the structure of local community more effectively, this paper puts forward a new local community detection algorithm based on minimal cluster. Most of the local community detection algorithms begin from one node. The agglomeration ability of a single node must be less than multiple nodes, so the beginning of the community extension of the algorithm in this paper is no longer from the initial node only but from a node cluster containing this initial node and nodes in the cluster are relatively densely connected with each other. The algorithm mainly includes two phases. First it detects the minimal cluster and then finds the local community extended from the minimal cluster. Experimental results show that the quality of the local community detected by our algorithm is much better than other algorithms no matter in real networks or in simulated networks.


2020 ◽  
Vol 7 (5) ◽  
pp. 4607-4615 ◽  
Author(s):  
Xiaolong Xu ◽  
Nan Hu ◽  
Marcello Trovati ◽  
Jeffrey Ray ◽  
Francesco Palmieri ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document