A new genetic algorithm for community detection using matrix representation method

2019 ◽  
Vol 535 ◽  
pp. 122259
Author(s):  
Kaiqi Chen ◽  
Weihong Bi
2020 ◽  
Vol 10 (9) ◽  
pp. 3126
Author(s):  
Desheng Lyu ◽  
Bei Wang ◽  
Weizhe Zhang

With the development of network technology and the continuous advancement of society, the combination of various industries and the Internet has produced many large-scale complex networks. A common feature of complex networks is the community structure, which divides the network into clusters with tight internal connections and loose external connections. The community structure reveals the important structure and topological characteristics of the network. The detection of the community structure plays an important role in social network analysis and information recommendation. Therefore, based on the relevant theory of complex networks, this paper introduces several common community detection algorithms, analyzes the principles of particle swarm optimization (PSO) and genetic algorithm and proposes a particle swarm-genetic algorithm based on the hybrid algorithm strategy. According to the test function, the single and the proposed algorithm are tested, respectively. The results show that the algorithm can maintain the good local search performance of the particle swarm optimization algorithm and also utilizes the good global search ability of the genetic algorithm (GA) and has good algorithm performance. Experiments on each community detection algorithm on real network and artificially generated network data sets show that the particle swarm-genetic algorithm has better efficiency in large-scale complex real networks or artificially generated networks.


2018 ◽  
Vol 126 ◽  
pp. 195-204 ◽  
Author(s):  
Marwa Ben M’Barek ◽  
Amel Borgi ◽  
Walid Bedhiafi ◽  
Sana Ben Hmida

IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 134583-134600 ◽  
Author(s):  
Xuchao Guo ◽  
Jie Su ◽  
Han Zhou ◽  
Chengqi Liu ◽  
Jing Cao ◽  
...  

2019 ◽  
Vol 32 (13) ◽  
pp. 9649-9665 ◽  
Author(s):  
Ranjan Kumar Behera ◽  
Debadatta Naik ◽  
Santanu Kumar Rath ◽  
Ramesh Dharavath

Symmetry ◽  
2019 ◽  
Vol 11 (12) ◽  
pp. 1472 ◽  
Author(s):  
Manuel Guerrero ◽  
Raul Baños ◽  
Consolación Gil ◽  
Francisco G. Montoya ◽  
Alfredo Alcayde

Symmetry is a key concept in the study of power systems, not only because the admittance and Jacobian matrices used in power flow analysis are symmetrical, but because some previous studies have shown that in some real-world power grids there are complex symmetries. In order to investigate the topological characteristics of power grids, this paper proposes the use of evolutionary algorithms for community detection using modularity density measures on networks representing supergrids in order to discover densely connected structures. Two evolutionary approaches (generational genetic algorithm, GGA+, and modularity and improved genetic algorithm, MIGA) were applied. The results obtained in two large networks representing supergrids (European grid and North American grid) provide insights on both the structure of the supergrid and the topological differences between different regions. Numerical and graphical results show how these evolutionary approaches clearly outperform to the well-known Louvain modularity method. In particular, the average value of modularity obtained by GGA+ in the European grid was 0.815, while an average of 0.827 was reached in the North American grid. These results outperform those obtained by MIGA and Louvain methods (0.801 and 0.766 in the European grid and 0.813 and 0.798 in the North American grid, respectively).


Sign in / Sign up

Export Citation Format

Share Document