scholarly journals Efficient Binary Symbiotic Organisms Search Algorithm Approaches for Feature Selection Problems

Author(s):  
Hekmat Mohmmadzadeh ◽  
Farhad Soleimanian Gharehchopogh

Feature selection is one of the main data preprocessing steps in machine learning. Its goal is to reduce the number of features by removing extra and noisy features. Feature selection methods must consider the accuracy of classification algorithms while performing feature reduction on a dataset. Meta-heuristic algorithms are the most successful and promising methods for solving this issue. The symbiotic organisms search algorithm is one of the successful meta-heuristic algorithms which is inspired by the interaction of organisms in the nature called Parasitism Commensalism Mutualism. In this paper, three engulfing binary methods based on the symbiotic organisms search algorithm are presented for solving the feature selection problem. In the first and second methods, several S-shaped and V-shaped transfer functions are used for binarizing the symbiotic organisms search algorithm, respectively. These methods are called BSOSS and BSOSV. In the third method, two new operators called BMP and BCP are presented for binarizing the symbiotic organisms search algorithm. This method is called EBSOS. The third approach presents an advanced binary version of the coexistence search algorithm with two new operators, BMP and BCP, to solve the feature selection problem, named EBSOS. The proposed methods are run on 18 standard UCI datasets and compared to base and important meta-heuristic algorithms. The test results show that the EBSOS method has the best performance among the three proposed approaches for binarization of the coexistence search algorithm. Finally, the proposed EBSOS approach was compared to other meta-heuristic methods including the genetic algorithm, binary bat algorithm, binary particle swarm algorithm, binary flower pollination algorithm, binary grey wolf algorithm, binary dragonfly algorithm, and binary chaotic crow search algorithm. The results of different experiments showed that the proposed EBSOS approach has better performance compared to other methods in terms of feature count and accuracy criteria. Furthermore, the proposed EBSOS approach was practically evaluated on spam email detection in particular. The results of this experiment also verified the performance of the proposed EBSOS approach. In addition, the proposed EBSOS approach is particularly combined with the classifiers including SVM, KNN, NB and MLP to evaluate this method performance in the detection of spam emails. The obtained results showed that the proposed EBSOS approach has significantly improved the accuracy and speed of all the classifiers in spam email detection.

2013 ◽  
Vol 2013 ◽  
pp. 1-13 ◽  
Author(s):  
Hong Zhao ◽  
Fan Min ◽  
William Zhu

Feature selection is an essential process in data mining applications since it reduces a model’s complexity. However, feature selection with various types of costs is still a new research topic. In this paper, we study the cost-sensitive feature selection problem of numeric data with measurement errors. The major contributions of this paper are fourfold. First, a new data model is built to address test costs and misclassification costs as well as error boundaries. It is distinguished from the existing models mainly on the error boundaries. Second, a covering-based rough set model with normal distribution measurement errors is constructed. With this model, coverings are constructed from data rather than assigned by users. Third, a new cost-sensitive feature selection problem is defined on this model. It is more realistic than the existing feature selection problems. Fourth, both backtracking and heuristic algorithms are proposed to deal with the new problem. Experimental results show the efficiency of the pruning techniques for the backtracking algorithm and the effectiveness of the heuristic algorithm. This study is a step toward realistic applications of the cost-sensitive learning.


2007 ◽  
Vol 2 (3) ◽  
pp. 299-308 ◽  
Author(s):  
Magdalene Marinaki ◽  
Yannis Marinakis ◽  
Michael Doumpos ◽  
Nikolaos Matsatsinis ◽  
Constantin Zopounidis

2008 ◽  
Vol 55 (5) ◽  
pp. 1019-1033 ◽  
Author(s):  
Idowu O. Oduntan ◽  
Michel Toulouse ◽  
Richard Baumgartner ◽  
Christopher Bowman ◽  
Ray Somorjai ◽  
...  

Computers ◽  
2018 ◽  
Vol 7 (4) ◽  
pp. 58 ◽  
Author(s):  
Jingwei Too ◽  
Abdul Abdullah ◽  
Norhashimah Mohd Saad ◽  
Nursabillilah Mohd Ali ◽  
Weihown Tee

Features extracted from the electromyography (EMG) signal normally consist of irrelevant and redundant features. Conventionally, feature selection is an effective way to evaluate the most informative features, which contributes to performance enhancement and feature reduction. Therefore, this article proposes a new competitive binary grey wolf optimizer (CBGWO) to solve the feature selection problem in EMG signals classification. Initially, short-time Fourier transform (STFT) transforms the EMG signal into time-frequency representation. Ten time-frequency features are extracted from the STFT coefficient. Then, the proposed method is used to evaluate the optimal feature subset from the original feature set. To evaluate the effectiveness of proposed method, CBGWO is compared with binary grey wolf optimization (BGWO1 and BGWO2), binary particle swarm optimization (BPSO), and genetic algorithm (GA). The experimental results show the superiority of CBGWO not only in classification performance, but also feature reduction. In addition, CBGWO has a very low computational cost, which is more suitable for real world application.


2021 ◽  
pp. 136943322110262
Author(s):  
Mohammad H Makiabadi ◽  
Mahmoud R Maheri

An enhanced symbiotic organisms search (ESOS) algorithm is developed and presented. Modifications to the basic symbiotic organisms search algorithm are carried out in all three phases of the algorithm with the aim of balancing the exploitation and exploration capabilities of the algorithm. To verify validity and capability of the ESOS algorithm in solving general optimization problems, the CEC2014 set of 22 benchmark functions is first optimized and the results are compared with other metaheuristic algorithms. The ESOS algorithm is then used to optimize the sizing and shape of five benchmark trusses with multiple frequency constraints. The best (minimum) mass, mean mass, standard deviation of the mass, total number of function evaluations, and the values of frequency constraints are then compared with those of a number of other metaheuristic solutions available in the literature. It is shown that the proposed ESOS algorithm is generally more efficient in optimizing the shape and sizing of trusses with dynamic frequency constraints compared to other reported metaheuristic algorithms, including the basic symbiotic organisms search and its other recently proposed improved variants such as the improved symbiotic organisms search algorithm (ISOS) and modified symbiotic organisms search algorithm (MSOS).


2021 ◽  
Vol 7 ◽  
pp. 293-303
Author(s):  
Yang Wang ◽  
Xinxiong Jiang ◽  
Faqi Yan ◽  
Yu Cai ◽  
Siyang Liao

Sign in / Sign up

Export Citation Format

Share Document