An ant colony based algorithm for overlapping community detection in complex networks

2015 ◽  
Vol 427 ◽  
pp. 289-301 ◽  
Author(s):  
Xu Zhou ◽  
Yanheng Liu ◽  
Jindong Zhang ◽  
Tuming Liu ◽  
Di Zhang
Keyword(s):  
Complex Networks ◽  
Community Detection ◽  
Ant Colony ◽  
Overlapping Community Detection ◽  
Overlapping Community

Community cores expansion for overlapping community detection in complex networks

2018 ◽  
Vol 32 (33) ◽  
pp. 1850405 ◽  
Author(s):  
Yongjie Yan ◽  
Guang Yu ◽  
Xiangbin Yan ◽  
Hui Xie
Keyword(s):  
Complex Networks ◽  
Community Detection ◽  
Heuristic Algorithm ◽  
Real World ◽  
Local Structure ◽  
Overlapping Community Detection ◽  
Overlapping Communities ◽  
Clique Percolation ◽  
Overlapping Community ◽  
Synthetic Datasets

The identification of communities has attracted considerable attentions in the last few years. We propose a novel heuristic algorithm for overlapping community detection based on community cores in complex networks. We introduce a novel clique percolation algorithm and maximize cliques in the finding overlapping communities (node covers) in graphs. We show how vertices can be used to quantify types of local structure presented in a community and identify group nodes that have similar roles in relation to their neighbors. We compare the approach with other three common algorithms in the analysis of the Zachary’s karate club network and the dolphins network. Experimental results in real-world and synthetic datasets (Lancichinetti–Fortunato–Radicchi (LFR) benchmark networks [A. Lancichinetti and S. Fortunato, Phys. Rev. E 80 (2009) 016118]) demonstrate the model has scalability and is well behaved.

scholarly journals A Local Overlapping Community Detection Method in Complex Networks

2012 ◽  
Vol 6-7 ◽  
pp. 985-990
Author(s):  
Yan Peng ◽  
Yan Min Li ◽  
Lan Huang ◽  
Long Ju Wu ◽  
Gui Shen Wang ◽  
...  
Keyword(s):  
Community Structure ◽  
Complex Networks ◽  
Community Detection ◽  
Real World ◽  
Detection Method ◽  
Experimental Results ◽  
Overlapping Community Detection ◽  
Greedy Strategy ◽  
Structure Detection ◽  
Overlapping Community

Community structure detection has great importance in finding the relationships of elements in complex networks. This paper presents a method of simultaneously taking into account the weak community structure definition and community subgraph density, based on the greedy strategy for community expansion. The results are compared with several previous methods on artificial networks and real world networks. And experimental results verify the feasibility and effectiveness of our approach.

Sign in / Sign up

Export Citation Format

Share Document