Aboul Ella Hassanien (Abo)

Support Vector Machine (SVM) parameters such as kernel parameter and penalty parameter (C) have a great impact on the complexity and accuracy of predicting model. In this paper, Bat algorithm (BA) has been proposed to optimize the parameters of SVM, so that the classification error can be reduced. To evaluate the proposed model (BA-SVM), the experiment adopted nine standard datasets which are obtained from UCI machine learning data repository. For verification, the results of the BA-SVM algorithm are compared with grid search, which is a conventional method of searching parameter values, and two well-known optimization algorithms: Genetic Algorithm (GA) and Particle Swarm Optimization (PSO). The experimental results proved that the proposed model is capable to find the optimal values of the SVM parameters and avoids the local optima problem. The results also demonstrated lower classification error rates compared with PSO and GA algorithms.

To satisfy the ever growing need for effective screening and diagnostic tests, medical practitioners have turned their attention to high resolution, high throughput methods. One approach is to use mass spectrometry based methods for disease diagnosis. Effective diagnosis is achieved by classifying the mass spectra as belonging to healthy or diseased individuals. Unfortunately, the high resolution mass spectrometry data contains a large degree of noisy, redundant and irrelevant information, making accurate classification difficult. To overcome these obstacles, feature extraction methods are used to select or create small sets of relevant features. This paper compares existing feature selection methods to a novel wrapper-based feature selection and centroid-based classification method. A key contribution is the exposition of different feature extraction techniques, which encompass dimensionality reduction and feature selection methods. The experiments, on two cancer data sets, indicate that feature selection algorithms tend to both reduce data dimensionality and increase classification accuracy, while the dimensionality reduction techniques sacrifice performance as a result of lowering the number of features. In order to evaluate the dimensionality reduction and feature selection techniques, we use a simple classifier, thereby making the approach tractable. In relation to previous research, the proposed algorithm is very competitive in terms of (i) classification accuracy, (ii) size of feature sets, (iii) usage of computational resources during both training and classification phases.

Representation and visualization of continuous data using the Formal Concept Analysis (FCA) became an
important requirement in real-life fields. Application of formal concept analysis (FCA) model on numerical
data, a scaling or Discretization / binarization procedures should be applied as preprocessing stage. The
Scaling procedure increases the complexity of computation of the FCA, while the binarization process leads to a distortion in the internal structure of the input data set. The proposed approach uses a binarization procedure prior to applying FCA model, and then applies a validation process to the generated lattice to measure or ensure its degree of accuracy. The introduced approach is based on the evaluation of each attribute according to the objects of its extent set. To prove the validity of the introduced approach, the technique is applied on two data sets in the medical field which are the Indian Diabetes and the Breast Cancer data sets. Both data sets show the generation of a valid lattice.

In this paper, binary variants of the ant lion optimizer (ALO) are proposed and used to select the optimal feature subset for classification purposes in wrapper-mode. ALO is one of the recently bio-inspired optimization techniques that imitates the hunting process of ant lions. Moreover, ALO balances exploration and exploitation using a single operator that can adaptively searches the domain of solutions for the optimal solution. Binary variants introduced here are performed using two different approaches. The first approach takes only the inspiration of ALO operators and makes the corresponding binary operators. In the second approach, the native ALO is applied while its continuous steps are threshold using suitable threshold function after squashing them. The proposed approaches for binary ant lion optimizer (BALO) are utilized in the feature selection domain for finding feature subset that maximizing the classification performance while minimizing the number of selected features. The proposed binary algorithms were compared to three common optimization algorithms hired in this domain namely particle swarm optimizer (PSO), genetic algorithms (GAs), binary bat algorithm (BBA), as well as the native ALO. A set of assessment indicators is used to evaluate and compare the different methods over 21 data sets from the UCI repository. Results prove the capability of the proposed binary algorithms to search the feature space for optimal feature combinations regardless of the initialization and the used stochastic operators.

In this work, a novel binary version of the gray wolf optimization (GWO) is proposed and used to select optimal feature subset for classification purposes. Gray wolf optimizer (GWO) is one of the latest bio-inspired optimization techniques, which simulate the hunting process of gray wolves in nature. The binary version introduced here is performed using two different approaches. In the first approach, individual steps toward the first three best solutions are binarized and then stochastic crossover is performed among the three basic moves to find the updated binary gray wolf position. In the second approach, sigmoidal function is used to squash the continuous updated position, then stochastically threshold these values to find the updated binary gray wolf position. The two approach for binary gray wolf optimization (bGWO) are hired in the feature selection domain for finding feature subset maximizing the classification accuracy while minimizing the number of selected features. The proposed binary versions were compared to two of the common optimizers used in this domain namely particle swarm optimizer and genetic algorithms. A set of assessment indicators are used to evaluate and compared the different methods over 18 different datasets from the UCI repository. Results prove the capability of the proposed binary version of gray wolf optimization (bGWO) to search the feature space for optimal feature combinations regardless of the initialization and the used stochastic operators.

There are still many obstacles for achieving high recognition accuracy for Arabic handwritten optical character recognition system, each character has a different shape, as well as the similarities between characters. In this chapter, several feature selection-based bio-inspired optimization algorithms including Bat Algorithm, Grey Wolf Optimization, Whale optimization Algorithm, Particle Swarm Optimization and Genetic Algorithm have been presented and an application of Arabic handwritten characters recognition has been chosen to see their ability and accuracy to recognize Arabic characters. The experiments have been performed using a benchmark dataset, CENPARMI by k-Nearest neighbors, Linear Discriminant Analysis, and random forests. The achieved results show superior results for the selected features when comparing the classification accuracy for the selected features by the optimization algorithms with the whole feature set in terms of the classification accuracy and the processing time. The experiments have been performed using a benchmark dataset, CENPARMI by k-Nearest neighbors, Linear Discriminant Analysis, and random forests. The achieved results show superior results for the selected features when comparing the classification accuracy for the selected features by the optimization algorithms with the whole feature set in terms of the classification accuracy and the processing time.

In this paper, two novel bio-inspired optimization algorithms; namely Dragonfly Algorithm (DA) and Grey Wolf Optimizer (GWO), have been applied for fulfilling the goal of feature set dimensional reduction. The proposed classification system has been tested via solving the problem of Electromyography (EMG) signal classification with optimal features subset selection. The obtained experimental results showed that the GWO based Support Vector Machines (SVM) classification algorithm has achieved an accuracy of 93.22% using 31% of the total extracted features. It also outperformed both the typical SVM algorithm, with no feature set optimization, and the DA based optimized feature set SVM classification, for the tested EMG dataset.