scholarly journals A Fuzzy Classifier with Feature Selection Based on the Gravitational Search Algorithm

Symmetry ◽  
2018 ◽  
Vol 10 (11) ◽  
pp. 609 ◽  
Author(s):  
Marina Bardamova ◽  
Anton Konev ◽  
Ilya Hodashinsky ◽  
Alexander Shelupanov

This paper concerns several important topics of the Symmetry journal, namely, pattern recognition, computer-aided design, diversity and similarity. We also take advantage of the symmetric and asymmetric structure of a transfer function, which is responsible to map a continuous search space to a binary search space. A new method for design of a fuzzy-rule-based classifier using metaheuristics called Gravitational Search Algorithm (GSA) is discussed. The paper identifies three basic stages of the classifier construction: feature selection, creating of a fuzzy rule base and optimization of the antecedent parameters of rules. At the first stage, several feature subsets are obtained by using the wrapper scheme on the basis of the binary GSA. Creating fuzzy rules is a serious challenge in designing the fuzzy-rule-based classifier in the presence of high-dimensional data. The classifier structure is formed by the rule base generation algorithm by using minimum and maximum feature values. The optimal fuzzy-rule-based parameters are extracted from the training data using the continuous GSA. The classifier performance is tested on real-world KEEL (Knowledge Extraction based on Evolutionary Learning) datasets. The results demonstrate that highly accurate classifiers could be constructed with relatively few fuzzy rules and features.

Author(s):  
Marina Borisovna Bardamova ◽  
Anton Konev ◽  
Ilya Hodashinsky ◽  
Alexander Shelupanov

Handwritten signatures are used in authentication systems as a universal biometric identifier. Signature authenticity verification requires building and training a classifier. This paper describes a new approach to the verification of handwritten signatures by dynamic characteristics with a fuzzy rule-based classifier. It is suggested to use the metaheuristic Gravitational Search Algorithm for the selection of the relevant features and tuning fuzzy rule parameters. The efficiency of the approach was tested with an original dataset; the type II errors in finding the signature authenticity did not exceed 0.5% for the worst model and 0.08% for the best model.


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.


2020 ◽  
Vol 93 ◽  
pp. 106341 ◽  
Author(s):  
Ritam Guha ◽  
Manosij Ghosh ◽  
Akash Chakrabarti ◽  
Ram Sarkar ◽  
Seyedali Mirjalili

2020 ◽  
Vol 31 (10) ◽  
pp. 2050138
Author(s):  
Yogesh Kumar ◽  
Shashi Kant Verma ◽  
Sandeep Sharma

This paper addresses an autonomous facial expression recognition system using the feature selection approach of the Quantum-Inspired Binary Gravitational Search Algorithm (QIBGSA). The detection of facial features completely depends upon the selection of precise features. The concept of QIBGSA is a modified binary version of the gravitational search algorithm by mimicking the properties of quantum mechanics. The QIBGSA approach reduces the computation cost for the initial extracted feature set using the hybrid approach of Local binary patterns with Gabor filter method. The proposed automated system is a sequential system with experimentation on the image-based dataset of Karolinska Directed Emotional Faces (KDEF) containing human faces with seven different emotions and different yaw angles. The experiments are performed to find out the optimal emotions using the feature selection approach of QIBGSA and classification using a deep convolutional neural network for robust and efficient facial expression recognition. Also, the effect of variations in the yaw angle (front to half side view) on facial expression recognition is studied. The results of the proposed system for the KDEF dataset are determined in three different cases of frontal view, half side view, and combined frontal and half side view images. The system efficacy is analyzed in terms of recognition rate.


Sign in / Sign up

Export Citation Format

Share Document