DocumentCode :
2068335
Title :
Bio-inspired algorithms for optimal feature subset selection
Author :
Chakraborty, Bishwajit
Author_Institution :
Fac. of Software & Inf. Sci., Iwate Prefectural Univ., Iwate, Japan
fYear :
2012
fDate :
17-19 Dec. 2012
Firstpage :
1
Lastpage :
7
Abstract :
Feature subset selection is one of the most important tasks for the success of pattern classification, data mining or machine learning applications. The basic objective of feature subset selection is to reduce the dimensionality of the problem while retaining the most discriminatory information necessary for accurate classification. Thus it is necessary to evaluate feature subsets for their ability to discriminate different classes of pattern. Now the fact that “two best features do not comprise the best feature subset of two features” demands evaluation of all possible subset of features to find out the best feature subset. If the number of features increases, the number of possible feature subsets grows exponentially leading to a combinatorial optimization problem. Biologically inspired evolutionary algorithms are known to be well suited for optimization problems and recently research in this direction is gaining momentum. In this talk, I am going to present an overview of proposed feature subset selection algorithms based on biologically inspired approaches, Artificial Neural Network (ANN), Genetic Algorithm (GA), Particle Swarm Optimization (PSO) and their hybrids.
Keywords :
feature extraction; genetic algorithms; learning (artificial intelligence); neural nets; particle swarm optimisation; ANN; GA; PSO; artificial neural network; biologically inspired evolutionary algorithm; combinatorial optimization problem; data mining; genetic algorithm; machine learning application; optimal feature subset selection; particle swarm optimization; pattern classification;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computers and Devices for Communication (CODEC), 2012 5th International Conference on
Conference_Location :
Kolkata
Print_ISBN :
978-1-4673-2619-3
Type :
conf
DOI :
10.1109/CODEC.2012.6509209
Filename :
6509209
Link To Document :
بازگشت