scholarly journals From Feature Selection to Continuous Optimization

2020 ◽  
pp. 1-12
Author(s):  
Hojjat Rakhshani ◽  
Lhassane Idoumghar ◽  
Julien Lepagnot ◽  
Mathieu Brévilliers
Keyword(s):  
Feature Selection ◽  
Continuous Optimization

scholarly journals A New Quadratic Binary Harris Hawk Optimization for Feature Selection

Electronics ◽  
2019 ◽  
Vol 8 (10) ◽  
pp. 1130 ◽  
Author(s):  
Too ◽  
Abdullah ◽  
Mohd Saad
Keyword(s):  
Feature Selection ◽  
Optimization Problems ◽  
Continuous Optimization ◽  
Continuous Variable ◽  
Classification Performance ◽  
Flower Pollination Algorithm ◽  
Feature Selection Problem ◽  
Binary Differential Evolution ◽  
Continuous Optimization Problems ◽  
Selection Algorithms

Harris hawk optimization (HHO) is one of the recently proposed metaheuristic algorithms that has proven to be work more effectively in several challenging optimization tasks. However, the original HHO is developed to solve the continuous optimization problems, but not to the problems with binary variables. This paper proposes the binary version of HHO (BHHO) to solve the feature selection problem in classification tasks. The proposed BHHO is equipped with an S-shaped or V-shaped transfer function to convert the continuous variable into a binary one. Moreover, another variant of HHO, namely quadratic binary Harris hawk optimization (QBHHO), is proposed to enhance the performance of BHHO. In this study, twenty-two datasets collected from the UCI machine learning repository are used to validate the performance of proposed algorithms. A comparative study is conducted to compare the effectiveness of QBHHO with other feature selection algorithms such as binary differential evolution (BDE), genetic algorithm (GA), binary multi-verse optimizer (BMVO), binary flower pollination algorithm (BFPA), and binary salp swarm algorithm (BSSA). The experimental results show the superiority of the proposed QBHHO in terms of classification performance, feature size, and fitness values compared to other algorithms.

scholarly journals Angle Modulated Artificial Bee Colony Algorithms for Feature Selection

2016 ◽  
Vol 2016 ◽  
pp. 1-6 ◽  
Author(s):  
Gürcan Yavuz ◽  
Doğan Aydin
Keyword(s):  
Feature Selection ◽  
Artificial Bee Colony ◽  
Continuous Optimization ◽  
Subset Selection ◽  
Machine Intelligence ◽  
Feature Subset Selection ◽  
High Dimensional ◽  
Feature Subset ◽  
Bee Colony ◽  
Angle Modulation

Optimal feature subset selection is an important and a difficult task for pattern classification, data mining, and machine intelligence applications. The objective of the feature subset selection is to eliminate the irrelevant and noisy feature in order to select optimum feature subsets and increase accuracy. The large number of features in a dataset increases the computational complexity thus leading to performance degradation. In this paper, to overcome this problem, angle modulation technique is used to reduce feature subset selection problem to four-dimensional continuous optimization problem instead of presenting the problem as a high-dimensional bit vector. To present the effectiveness of the problem presentation with angle modulation and to determine the efficiency of the proposed method, six variants of Artificial Bee Colony (ABC) algorithms employ angle modulation for feature selection. Experimental results on six high-dimensional datasets show that Angle Modulated ABC algorithms improved the classification accuracy with fewer feature subsets.

scholarly journals An Improved Artificial Bee Colony for Feature Selection in QSAR

Algorithms ◽  
2021 ◽  
Vol 14 (4) ◽  
pp. 120
Author(s):  
Yanhong Lin ◽  
Jing Wang ◽  
Xiaolin Li ◽  
Yuanzi Zhang ◽  
Shiguo Huang
Keyword(s):  
Feature Selection ◽  
Artificial Bee Colony ◽  
Molecular Descriptors ◽  
Optimization Problems ◽  
Continuous Optimization ◽  
Selection Strategy ◽  
Bee Colony ◽  
Mutation Operators ◽  
Regression Problems ◽  
Discrete Values

Quantitative Structure–Activity Relationship (QSAR) aims to correlate molecular structure properties with corresponding bioactivity. Chance correlations and multicollinearity are two major problems often encountered when generating QSAR models. Feature selection can significantly improve the accuracy and interpretability of QSAR by removing redundant or irrelevant molecular descriptors. An artificial bee colony algorithm (ABC) that mimics the foraging behaviors of honey bee colony was originally proposed for continuous optimization problems. It has been applied to feature selection for classification but seldom for regression analysis and prediction. In this paper, a binary ABC algorithm is used to select features (molecular descriptors) in QSAR. Furthermore, we propose an improved ABC-based algorithm for feature selection in QSAR, namely ABC-PLS-1. Crossover and mutation operators are introduced to employed bee and onlooker bee phase to modify several dimensions of each solution, which not only saves the process of converting continuous values into discrete values, but also reduces the computational resources. In addition, a novel greedy selection strategy which selects the feature subsets with higher accuracy and fewer features helps the algorithm to converge fast. Three QSAR datasets are used for the evaluation of the proposed algorithm. Experimental results show that ABC-PLS-1 outperforms PSO-PLS, WS-PSO-PLS, and BFDE-PLS in accuracy, root mean square error, and the number of selected features. Moreover, we also study whether to implement scout bee phase when tracking regression problems and drawing such an interesting conclusion that the scout bee phase is redundant when dealing with the feature selection in low-dimensional and medium-dimensional regression problems.

Feature Selection Strategies and Perceptual Expertise in Configuration Search Tasks

2011 ◽  
Author(s):  
Lindsey M. Kitchell ◽  
Francisco J. Parada ◽  
Brandi L. Emerick ◽  
Tom A. Busey
Keyword(s):  
Feature Selection ◽  
Perceptual Expertise ◽  
Search Tasks ◽  
Selection Strategies

BLIND FEATURE SELECTION AND EXTRACTION IN A 3D IMAGE CUBE

2012 ◽  
Vol 19 (2) ◽  
pp. 97-111 ◽  
Author(s):  
Muhammad Ahmad ◽  
Syungyoung Lee ◽  
Ihsan Ul Haq ◽  
Qaisar Mushtaq
Keyword(s):  
Feature Selection ◽  
3D Image ◽  
Image Cube

An Enhancement of Feature Selection Algorithm for EDM: A Review

2018 ◽  
Vol 8 (5) ◽  
pp. 29
Author(s):  
Manpreet Kaur ◽  
Chamkaur Singh
Keyword(s):  
Feature Selection ◽  
Educational Data Mining ◽  
Problem Formulation ◽  
Research Area ◽  
Education Quality ◽  
Educational Institutions ◽  
Selection Algorithm ◽  
Positive Role ◽  
Data Set ◽  
Selection Algorithms

Educational Data Mining (EDM) is an emerging research area help the educational institutions to improve the performance of their students. Feature Selection (FS) algorithms remove irrelevant data from the educational dataset and hence increases the performance of classifiers used in EDM techniques. This paper present an analysis of the performance of feature selection algorithms on student data set. .In this papers the different problems that are defined in problem formulation. All these problems are resolved in future. Furthermore the paper is an attempt of playing a positive role in the improvement of education quality, as well as guides new researchers in making academic intervention.

Feature selection of the armature winding broken coils in synchronous motor using genetic algorithm and mahalanobis distance

2012 ◽  
Vol 57 (3) ◽  
pp. 829-835 ◽  
Author(s):  
Z. Głowacz ◽  
J. Kozik
Keyword(s):  
Genetic Algorithm ◽  
Feature Selection ◽  
Mahalanobis Distance ◽  
Distance Measure ◽  
Synchronous Motor ◽  
Medical Diagnostics ◽  
Motor Current ◽  
Feature Spaces ◽  
Multidimensional Feature Spaces ◽  
Selection Of

The paper describes a procedure for automatic selection of symptoms accompanying the break in the synchronous motor armature winding coils. This procedure, called the feature selection, leads to choosing from a full set of features describing the problem, such a subset that would allow the best distinguishing between healthy and damaged states. As the features the spectra components amplitudes of the motor current signals were used. The full spectra of current signals are considered as the multidimensional feature spaces and their subspaces are tested. Particular subspaces are chosen with the aid of genetic algorithm and their goodness is tested using Mahalanobis distance measure. The algorithm searches for such a subspaces for which this distance is the greatest. The algorithm is very efficient and, as it was confirmed by research, leads to good results. The proposed technique is successfully applied in many other fields of science and technology, including medical diagnostics.

Sign in / Sign up

Export Citation Format

Share Document