By Topic

Distributed MOPSO with a new population subdivision technique for the feature 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
$31 $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

3 Author(s)
Fdhila, R. ; REGIM: Res. Group on, Intell. Machines, Univ. of Sfax, Sfax, Tunisia ; Hamdani, T.M. ; Alimi, A.M.

In this paper, a new Multi-Objective Particle Swarm Optimization (MOPSO) is applied to solve a problem of feature selection defined as a multiobjective problem. This algorithm (pMOPSO), known for its fast convergence with negligible computation time is based on a distributed architecture. Sub-swarms are obtained from dynamic subdivision of the population using Pareto Fronts. The algorithm addresses a problem defined by two goals, characterized by their contradictory aspect, namely, minimizing the error rate and minimizing the number of features. The two objectives are treated simultaneously constituting the objective function. Performance of our approach is compared with other evolutionary techniques using databases choosing from the UCI repository [1].

Published in:

Computational Intelligence and Intelligent Informatics (ISCIII), 2011 5th International Symposium on

Date of Conference:

15-17 Sept. 2011