Multiobjective Genetic Method for Community Discovery in Complex Networks

Author(s):  
Bingyu Liu ◽  
Cuirong Wang ◽  
Cong Wang
2021 ◽  
Vol 94 (7) ◽  
Author(s):  
Xiaoyu Li ◽  
Chao Gao ◽  
Songxin Wang ◽  
Zhen Wang ◽  
Chen Liu ◽  
...  

2011 ◽  
Vol 4 (5) ◽  
pp. 512-546 ◽  
Author(s):  
Michele Coscia ◽  
Fosca Giannotti ◽  
Dino Pedreschi

2019 ◽  
Vol 527 ◽  
pp. 121338 ◽  
Author(s):  
Swarup Chattopadhyay ◽  
Tanmay Basu ◽  
Asit K. Das ◽  
Kuntal Ghosh ◽  
C.A. Murthy

2014 ◽  
Vol 28 (19) ◽  
pp. 1450126
Author(s):  
Zongwen Liang ◽  
Athina Petropulu ◽  
Fan Yang ◽  
Jianping Li

Community detection is a fundamental work to analyze the structural and functional properties of complex networks. There are many algorithms proposed to find the optimal communities of network. In this paper, we focus on how vertex order influences the results of community detection. By using consensus clustering, we discover communities and get a consensus matrix under different vertex orders. Based on the consensus matrix, we study the phenomenon that some nodes are always allocated in the same community even with different vertex permutations. We call this group of nodes as constant community and propose a constant community detection algorithm (CCDA) to find constant communities in network. We also further study the internal properties of constant communities and find constant communities play a guiding role in community detection. Finally, a discussion of constant communities is given in the hope of being useful to others working in this field.


2019 ◽  
Vol 28 (04) ◽  
pp. 1950011
Author(s):  
Rongwang Chen ◽  
Qingshou Wu ◽  
Wenzhong Guo ◽  
Kun Guo ◽  
Qinze Wang

We propose an overlapping community discovery algorithm that combines node influence and [Formula: see text]-connected neighbors for effectively detecting the overlapping community structure of complex networks. On the basis of the node influence and [Formula: see text]-connected neighbors, our method accurately detects the core node community and uses the improved similarity between the node and community to expand the core node community. Accordingly, the discovery and optimization of network overlapping communities are realized. Experiments on artificial and real-world networks demonstrate that our method significantly and consistently outperforms other comparison methods.


2020 ◽  
Vol 1533 ◽  
pp. 032076
Author(s):  
Lintao Lv ◽  
Jialin Wu ◽  
Hui Lv

2014 ◽  
Vol 926-930 ◽  
pp. 2932-2937
Author(s):  
Chi Zhang ◽  
Li Xu ◽  
Chang Liu ◽  
Chun Long Fan

In order to quickly and accurately find the community structure of complex networks ,This article start from the similarity of the node ,Proposed a new community discovery algorithm. Introduced similar values and custom node value Q during the process of algorithm design ,Firstly , To Select the nodes with the largest similarity value by calculating the similarity between nodes ,Then to decide to join and expand the nodes by calculating the Q value is greater than 0 or not. Repeat the above process, you can get the whole network of community structure, The process does not require any auxiliary information or other seed nodes. Applied to the actual network experiment results verify the feasibility of the algorithm.


Sign in / Sign up

Export Citation Format

Share Document