By Topic

Binary Particle Swarm Optimization Based Algorithm for Feature Subset Selection

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Chakraborty, Basabi ; Fac. of Software & Inf. Sci., Iwate Prefectural Univ., Iwate

The feature subset selection can be considered as a global combinatorial optimization problem in which the optimum subset of features is selected from a large set of features. Lots of techniques have developed so far, still research is going on to find better solution in terms of optimality and computational ease. In this work an algorithm based on binary particle swarm optimization (bPSO) is proposed for feature subset selection. From simple simulation experiments it has been found that bPSO based algorithm performs well and computationally less demanding than genetic algorithm, another population based evolutionary search technique.

Published in:

Advances in Pattern Recognition, 2009. ICAPR '09. Seventh International Conference on

Date of Conference:

4-6 Feb. 2009