arrow
Return

Evolutionary computation for feature selection in classification problems

delete2013-10-17
delete53
PRE
AI
B
Beatriz de la Iglesia *
DOI:10.1002/widm.1106delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Feature subset selection (FSS) has received a great deal of attention in statistics, machine learning, and data mining. Real world data analyzed by data mining algorithms can involve a large number of redundant or irrelevant features or simply too many features for a learning algorithm to handle them efficiently. Feature selection is becoming essential as databases grow in size and complexity. The selection process is expected to bring benefits in terms of better performing models, computational efficiency, and simpler more understandable models. Evolutionary computation (EC) encompasses a number of naturally inspired techniques such as genetic algorithms, genetic programming, ant colony optimization, or particle swarm optimization algorithms. Such techniques are well suited to feature selection because the representation of a feature subset is straightforward and the evaluation can also be easily accomplished through the use of wrapper or filter algorithms. Furthermore, the capability of such heuristic algorithms to efficiently search large search spaces is of great advantage to the feature selection problem. Here, we review the use of different EC paradigms for feature selection in classification problems. We discuss details of each implementation including representation, evaluation, and validation. The review enables us to uncover the best EC algorithms for FSS and to point at future research directions. (C) 2013 John Wiley & Sons, Ltd.
Keywords:
FEATURE SUBSET-SELECTION
EFFICIENT FEATURE-SELECTION
GENETIC ALGORITHM
MEMETIC ALGORITHMS
OPTIMIZATION
GA
ACO
METAHEURISTICS
SYSTEM
COLONY
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Wiley Interdisciplinary Reviews-Data Mining and Knowledge Discovery cover
Wiley Interdisciplinary Reviews-Data Mining and Knowledge Discovery
IF:
11.7
Papers:
544
Citations:
5.3K

Organization

No organization information available
Cited Papers

Cited Papers

Using S3D to analyze ship system alternatives for a 100 MW 10,000 ton surface combatant
err2017-08-01
err0
errOAAI
errRichard Smart; Julie Chalfant; John Herbst; Blake Langland; Angela Card; Rod Leonard; Angelo Gattozzi
errShare
errSave
errShare
errSave
Feature Subset Selection by Bayesian network-based optimization
err2000-10-01
err186
errOAAI
errInza, I; Larrañaga, P; Etxeberria, R; Sierra, B
errShare
errSave
Reconsolidation of a well-learned instrumental memory
err2014-08-18
err0
errOAAI
errMarc T.J. Exton-McGuinness; Rosemary C. Patton; Lawrence B. Sacco; Jonathan L.C. Lee
errShare
errSave
Enhancement of perpendicular coercivity in L11 CoPt thin films by replacement of Co with Cu
err2010-12-07
err0
errOAAI
errFu-Te Yuan; An-Cheng Sun; Jen-Hwa Hsu; C. S. Tan; P. C. Kuo; W. M. Liao; H. Y. Lee
errShare
errSave
The electroneutrality approximation in electrochemistry
err2011-02-22
err0
PREAI
errEdmund J. F. Dickinson; Juan G. Limon-Petersen; Richard G. Compton
errShare
errSave
researcher View more