A novel local extrema based gravitational search algorithm and its application in face recognition using one training image per class

Author(s):  
Tapabrata Chakraborti ◽  
Kaushik Das Sharma ◽  
Amitava Chatterjee
Author(s):  
Lavika Goel ◽  
Lavanya B. ◽  
Pallavi Panchal

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.


2016 ◽  
Vol 3 (4) ◽  
pp. 1-11
Author(s):  
M. Lakshmikantha Reddy ◽  
◽  
M. Ramprasad Reddy ◽  
V.C. Veera Reddy ◽  
◽  
...  

Author(s):  
Umit Can ◽  
Bilal Alatas

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.


2021 ◽  
Vol 11 (10) ◽  
pp. 4438
Author(s):  
Satyendra Singh ◽  
Manoj Fozdar ◽  
Hasmat Malik ◽  
Maria del Valle Fernández Moreno ◽  
Fausto Pedro García Márquez

It is expected that large-scale producers of wind energy will become dominant players in the future electricity market. However, wind power output is irregular in nature and it is subjected to numerous fluctuations. Due to the effect on the production of wind power, producing a detailed bidding strategy is becoming more complicated in the industry. Therefore, in view of these uncertainties, a competitive bidding approach in a pool-based day-ahead energy marketplace is formulated in this paper for traditional generation with wind power utilities. The profit of the generating utility is optimized by the modified gravitational search algorithm, and the Weibull distribution function is employed to represent the stochastic properties of wind speed profile. The method proposed is being investigated and simplified for the IEEE-30 and IEEE-57 frameworks. The results were compared with the results obtained with other optimization methods to validate the approach.


Sign in / Sign up

Export Citation Format

Share Document