A Discrete Bat Algorithm for the Community Detection Problem

A Comprehensive Review of Bat Inspired Algorithm: Variants, Applications, and Hybridization

Bat algorithm (BA) is one of the promising metaheuristic algorithms. It proved its efficiency in dealing with various optimization problems in diverse fields, such as power and energy systems, economic load dispatch problems, engineering design, image processing and medical applications. Thus, this review introduces a comprehensive and exhaustive review of the BA, as well as evaluates its main characteristics by comparing it with other optimization algorithms. The review paper highlights the performance of BA in different applications and the modifications that have been conducted by researchers (i.e., variants of BA). At the end, the conclusions focus on the current work on BA, highlighting its weaknesses, and suggest possible future research directions. The review paper will be helpful for the researchers and practitioners of BA belonging to a wide range of audiences from the domains of optimization, engineering, medical, data mining and clustering. As well, it is wealthy in research on health, environment and public safety. Also, it will aid those who are interested by providing them with potential future research.

Finding Community of Brain Networks Based on Neighbor Index and DPSO with Dynamic Crossover

Background: :

The brain networks can provide us an effective way to analyze brain function and brain disease detection. In brain networks, there exist some import neural unit modules, which contain meaningful biological insights.

Objective::

Therefore, we need to find the optimal neural unit modules effectively and efficiently.

Method::

In this study, we propose a novel algorithm to find community modules of brain networks by combining Neighbor Index and Discrete Particle Swarm Optimization (DPSO) with dynamic crossover, abbreviated as NIDPSO. The differences between this study and the existing ones lie in that NIDPSO is proposed first to find community modules of brain networks, and dose not need to predefine and preestimate the number of communities in advance.

Results: :

We generate a neighbor index table to alleviate and eliminate ineffective searches and design a novel coding by which we can determine the community without computing the distances amongst vertices in brain networks. Furthermore, dynamic crossover and mutation operators are designed to modify NIDPSO so as to alleviate the drawback of premature convergence in DPSO.

Conclusion:

The numerical results performing on several resting-state functional MRI brain networks demonstrate that NIDPSO outperforms or is comparable with other competing methods in terms of modularity, coverage and conductance metrics.

Community Structure Detection Using Firefly Algorithm

This article describes how parallel to the continuous growth of the Internet, which allows people to share and collaborate more, social networks have become more attractive as a research topic in many different disciplines. Community structures are established upon interactions between people. Detection of these communities has become a popular topic in computer science. How to detect the communities is of great importance for understanding the organization and function of networks. Community detection is considered a variant of the graph partitioning problem which is NP-hard. In this article, the Firefly algorithm is used as an optimization algorithm to solve the community detection problem by maximizing the modularity measure. Firefly algorithm is a new Nature-inspired heuristic algorithm that proved its good performance in a variety of applications. Experimental results obtained from tests on real-life networks demonstrate that the authors' algorithm successfully detects the community structure.