scholarly journals Genetic Algorithm for Community Detection in Biological Networks

2018 ◽  
Vol 126 ◽  
pp. 195-204 ◽  
Author(s):  
Marwa Ben M’Barek ◽  
Amel Borgi ◽  
Walid Bedhiafi ◽  
Sana Ben Hmida
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.


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

Data ◽  
2019 ◽  
Vol 4 (4) ◽  
pp. 149
Author(s):  
Amulyashree Sridhar ◽  
Sharvani GS ◽  
AH Manjunatha Reddy ◽  
Biplab Bhattacharjee ◽  
Kalyan Nagaraj

Exploring gene networks is crucial for identifying significant biological interactions occurring in a disease condition. These interactions can be acknowledged by modeling the tie structure of networks. Such tie orientations are often detected within embedded community structures. However, most of the prevailing community detection modules are intended to capture information from nodes and its attributes, usually ignoring the ties. In this study, a modularity maximization algorithm is proposed based on nonlinear representation of local tangent space alignment (LTSA). Initially, the tangent coordinates are computed locally to identify k-nearest neighbors across the genes. These local neighbors are further optimized by generating a nonlinear network embedding function for detecting gene communities based on eigenvector decomposition. Experimental results suggest that this algorithm detects gene modules with a better modularity index of 0.9256, compared to other traditional community detection algorithms. Furthermore, co-expressed genes across these communities are identified by discovering the characteristic tie structures. These detected ties are known to have substantial biological influence in the progression of schizophrenia, thereby signifying the influence of tie patterns in biological networks. This technique can be extended logically on other diseases networks for detecting substantial gene “hotspots”.


Sign in / Sign up

Export Citation Format

Share Document