• Home
  • Search
  • Evolutionary Computation for Feature Selection in Classification
  • https://doi.org/10.26686/wgtn.17134145.v1Copy DOI Icon

Evolutionary Computation for Feature Selection in Classification

  • Jan 1, 2018
  • Hoai Nguyen
Show More
  • Abstract
  • Literature Map
  • References
  • Similar Papers
Abstract

<p>Classification aims to identify a class label of an instance according to the information from its characteristics or features. Unfortunately, many classification problems have a large feature set containing irrelevant and redundant features, which reduce the classification performance. In order to address the above problem, feature selection is proposed to select a small subset of relevant features. There are three main types of feature selection methods, i.e. wrapper, embedded and filter approaches. Wrappers use a classification algorithm to evaluate candidate feature subsets. In embedded approaches, the selection process is embedded in the training process of a classification algorithm. Different from the other two approaches, filters do not involve any classification algorithm during the selection process. Feature selection is an important process but it is not an easy task due to its large search space and complex feature interactions. Because of the potential global search ability, Evolutionary Computation (EC), especially Particle Swarm Optimization (PSO), has been widely and successfully applied to feature selection. However, there is potential to improve the effectiveness and efficiency of EC-based feature selection. The overall goal of this thesis is to investigate and improve the capability of EC for feature selection to select small feature subsets while maintaining or even improving the classification performance compared to using all features. Different aspects of feature selection are considered in this thesis such as the number of objectives (single-objective/multi-objective), the fitness function (filter/wrapper), and the searching mechanism. This thesis introduces a new fitness function based on mutual information which is calculated by an estimation approach instead of the traditional counting approach. Results show that the estimation approach works well on both continuous and discrete data. More importantly, mutual information calculated by the estimation approach can capture feature interactions better than the traditional counting approach. This thesis develops a novel binary PSO algorithm, which is the first work to redefine some core concepts of PSO such as velocity and momentum to suit the characteristics of binary search spaces. Experimental results show that the proposed binary PSO algorithm evolve better solutions than other binary EC algorithms when the search spaces are large and complex. Specifically, on feature selection, the proposed binary PSO algorithm can select smaller feature subsets with similar or better classification accuracies, especially when there are a large number of features. This thesis proposes surrogate models for wrapper-based feature selection. The surrogate models use surrogate training sets which are subsets of informative instances selected from the training set. Experimental results show that the proposed surrogate models assist PSO to reduce the computational cost while maintaining or even improving the classification performance compared to using only the original training set. The thesis develops the first wrapper-based multi-objective feature selection algorithm using MOEA/D. A new decomposition strategy using multiple reference points for MOEA/D is designed, which can deal with different characteristics of multi-objective feature selection such as highly discontinuous Pareto fronts and complex relationships between objectives. The experimental results show that the proposed algorithm can evolve more diverse non-dominated sets than other multi-objective algorithms. This thesis introduces the first PSO-based feature selection algorithm for transfer learning. In the proposed algorithm, the fitness function uses classification performance to reduce the differences between domains while maintaining the discriminative ability on the target domain. The experimental results show that the proposed algorithm can select feature subsets which achieve better classification performance than four state-of-the-art feature-based transfer learning algorithms.</p>

Similar Papers
  • Dissertation
  • Citations4

Particle Swarm Optimisation for Feature Selection in Classification

  • Jan 01, 2014
  • Bing Xue
  • Book Chapter
  • Citations32

A Particle Swarm Optimisation Based Multi-objective Filter Approach to Feature Selection for Classification

  • Jan 01, 2012
  • Bing Xue +3
  • Book Chapter
  • Citations55

Novel Initialisation and Updating Mechanisms in PSO for Feature Selection in Classification

  • Jan 01, 2013
  • Bing Xue +2
  • Research Article
  • Citations21

Combination of Ant Colony Optimization and Bayesian Classification for Feature Selection in a Bioinformatics Dataset

  • Jan 01, 2009
  • Journal of Computer Science & Systems Biology
  • Mehdi Hosseinzadeh Aghdam
  • Conference Article
  • Citations19

A Grid-dominance based Multi-objective Algorithm for Feature Selection in Classification

  • Jun 28, 2021
  • Peng Wang +3
  • Conference Article
  • Citations10

Hybridising Particle Swarm optimisation with Differential Evolution for Feature Selection in Classification

  • Jul 01, 2020
  • Ke Chen +3
  • Conference Article
  • Citations21

An archive based particle swarm optimisation for feature selection in classification

  • Jul 01, 2014
  • Bing Xue +2
  • Conference Article
  • Citations2

Feature selection based on niching particle swarm optimization for omics data classification

  • Dec 01, 2020
  • Zhao Xu +1
  • Research Article
  • Citations55

Feature selection with limited datasets

  • Oct 01, 1999
  • Medical Physics
  • Matthew A Kupinski +1
  • PDF
  • Research Article
  • Citations8

A Tri-Objective Method for Bi-Objective Feature Selection in Classification.

  • Sep 03, 2024
  • Evolutionary computation
  • Ruwang Jiao +2
  • Research Article
  • Citations4

A Novel Multi-Objective Moth-Flame Optimization Algorithm for Feature Selection

  • Oct 01, 2018
  • Indian Journal of Science and Technology
  • M A Soliman Ghada +3
  • Research Article
  • Citations21

Balancing Different Optimization Difficulty Between Objectives in Multiobjective Feature Selection

  • Dec 01, 2024
  • IEEE Transactions on Evolutionary Computation
  • Zhenshou Song +3
  • PDF
  • Book Chapter
  • Citations6

Biomarker Discovery Based on Large-Scale Feature Selection and MapReduce

  • Jan 01, 2015
  • Ahlam Kourid +1
  • PDF
  • Research Article
  • Citations31

Software Defect Prediction Using Wrapper Feature Selection Based on Dynamic Re-Ranking Strategy

  • Nov 12, 2021
  • Symmetry
  • Abdullateef Oluwagbemiga Balogun +9
  • Preprint Article

A multi-objective artificial bee colony approach to feature selection using fuzzy mutual information

  • Mar 16, 2021
  • E Hancer +4
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.