Hybridization of Biogeography-Based Optimization and Gravitational Search Algorithm for Efficient Face Recognition

2019 ◽  
pp. 258-279
Author(s):  
Lavika Goel ◽  
Lavanya B. ◽  
Pallavi Panchal
Keyword(s):  
Face Recognition ◽  
Evolutionary Algorithm ◽  
Search Algorithm ◽  
Gravitational Search Algorithm ◽  
Recognition Rate ◽  
Experimental Results ◽  
Nature Inspired Algorithm ◽  
In The Wild ◽  
Gravitational Search

This chapter aims to apply a novel hybridized evolutionary algorithm to the application of face recognition. Biogeography-based optimization (BBO) has some element of randomness to it that apart from improving the feasibility of a solution could reduce it as well. In order to overcome this drawback, this chapter proposes a hybridization of BBO with gravitational search algorithm (GSA), another nature-inspired algorithm, by incorporating certain knowledge into BBO instead of the randomness. The migration procedure of BBO that migrates SIVs between solutions is done between solutions only if the migration would lead to the betterment of a solution. BBO-GSA algorithm is applied to face recognition with the LFW (labelled faces in the wild) and ORL datasets in order to test its efficiency. Experimental results show that the proposed BBO-GSA algorithm outperforms or is on par with some of the nature-inspired techniques that have been applied to face recognition so far by achieving a recognition rate of 80% with the LFW dataset and 99.75% with the ORL dataset.

An ensemble approach of improved quantum inspired gravitational search algorithm and hybrid deep neural networks for computational optimization

2021 ◽  
pp. 2150100
Author(s):  
Yogesh Kumar ◽  
Shashi Kant Verma ◽  
Sandeep Sharma
Keyword(s):  
Neural Networks ◽  
Facial Expression ◽  
Deep Neural Networks ◽  
Search Algorithm ◽  
Gravitational Search Algorithm ◽  
Recognition Rate ◽  
Expression Recognition ◽  
Computational Optimization ◽  
Ensemble Approach ◽  
Gravitational Search

In this paper, an autonomous ensemble approach of improved quantum inspired gravitational search algorithm (IQI-GSA) and hybrid deep neural networks (HDNN) is proposed for the optimization of computational problems. The IQI-GSA is a combinational variant of gravitational search algorithm (GSA) and quantum computing (QC). The improved variant enhances the diversity of mass collection for retaining the stochastic attributes and handling the local trapping of mass agents. Further, the hybrid deep neural network encompasses the convolutional and recurrent neural networks (HDCR-NN) which analyze the relational & temporal dependencies among the different computational components for optimization. The proposed ensemble approach is evaluated for the application of facial expression recognition by experimentation on Karolinska Directed Emotional Faces (KDEF) and Japanese Female Facial Expression (JAFFE) datasets. The experimentation evaluations evidently exhibit the outperformed recognition rate of the proposed ensemble approach in comparison with state-of-the-art techniques.

Swarm-based chaotic gravitational search algorithm for solving mechanical engineering design problems

2020 ◽  
Vol 17 (1) ◽  
pp. 97-114
Author(s):  
Sajad Ahmad Rather ◽  
P. Shanthi Bala
Keyword(s):  
Engineering Design ◽  
Mechanical Engineering ◽  
Gravitational Constant ◽  
Chaotic Maps ◽  
Search Algorithm ◽  
Gravitational Search Algorithm ◽  
Experimental Results ◽  
Content Type ◽  
Efficient Performance ◽  
Gravitational Search

Purpose The purpose of this paper is to investigate the performance of chaotic gravitational search algorithm (CGSA) in solving mechanical engineering design frameworks including welded beam design (WBD), compression spring design (CSD) and pressure vessel design (PVD). Design/methodology/approach In this study, ten chaotic maps were combined with gravitational constant to increase the exploitation power of gravitational search algorithm (GSA). Also, CGSA has been used for maintaining the adaptive capability of gravitational constant. Furthermore, chaotic maps were used for overcoming premature convergence and stagnation in local minima problems of standard GSA. Findings The chaotic maps have shown efficient performance for WBD and PVD problems. Further, they have depicted competitive results for CSD framework. Moreover, the experimental results indicate that CGSA shows efficient performance in terms of convergence speed, cost function minimization, design variable optimization and successful constraint handling as compared to other participating algorithms. Research limitations/implications The use of chaotic maps in standard GSA is a new beginning for research in GSA particularly convergence and time complexity analysis. Moreover, CGSA can be used for solving the infinite impulsive response (IIR) parameter tuning and economic load dispatch problems in electrical sciences. Originality/value The hybridization of chaotic maps and evolutionary algorithms for solving practical engineering problems is an emerging topic in metaheuristics. In the literature, it can be seen that researchers have used some chaotic maps such as a logistic map, Gauss map and a sinusoidal map more rigorously than other maps. However, this work uses ten different chaotic maps for engineering design optimization. In addition, non-parametric statistical test, namely, Wilcoxon rank-sum test, was carried out at 5% significance level to statistically validate the simulation results. Besides, 11 state-of-the-art metaheuristic algorithms were used for comparative analysis of the experimental results to further raise the authenticity of the experimental setup.

Analysis of Optimal Power Flow Using Gravitational Search Algorithm

2016 ◽  
Vol 3 (4) ◽  
pp. 1-11
Author(s):  
M. Lakshmikantha Reddy ◽  
◽  
M. Ramprasad Reddy ◽  
V.C. Veera Reddy ◽  
◽  
...  
Keyword(s):  
Power Flow ◽  
Optimal Power Flow ◽  
Search Algorithm ◽  
Gravitational Search Algorithm ◽  
Optimal Power ◽  
Gravitational Search

Automatic Mining of Quantitative Association Rules with Gravitational Search Algorithm

2017 ◽  
Vol 27 (03) ◽  
pp. 343-372 ◽  
Author(s):  
Umit Can ◽  
Bilal Alatas
Keyword(s):  
Association Rules ◽  
Optimization Problems ◽  
Search Algorithm ◽  
Fitness Function ◽  
Optimization Algorithms ◽  
Gravitational Search Algorithm ◽  
Search Space ◽  
Search Method ◽  
Quantitative Association Rules ◽  
Gravitational Search

The classical optimization algorithms are not efficient in solving complex search and optimization problems. Thus, some heuristic optimization algorithms have been proposed. In this paper, exploration of association rules within numerical databases with Gravitational Search Algorithm (GSA) has been firstly performed. GSA has been designed as search method for quantitative association rules from the databases which can be regarded as search space. Furthermore, determining the minimum values of confidence and support for every database which is a hard job has been eliminated by GSA. Apart from this, the fitness function used for GSA is very flexible. According to the interested problem, some parameters can be removed from or added to the fitness function. The range values of the attributes have been automatically adjusted during the time of mining of the rules. That is why there is not any requirements for the pre-processing of the data. Attributes interaction problem has also been eliminated with the designed GSA. GSA has been tested with four real databases and promising results have been obtained. GSA seems an effective search method for complex numerical sequential patterns mining, numerical classification rules mining, and clustering rules mining tasks of data mining.

Sign in / Sign up

Export Citation Format

Share Document