4.7 Article

Feature selection with Intelligent Dynamic Swarm and Rough Set

Journal

EXPERT SYSTEMS WITH APPLICATIONS
Volume 37, Issue 10, Pages 7026-7032

Publisher

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.eswa.2010.03.016

Keywords

Data mining; Feature selection; Particle Swarm Optimization (PSO); Intelligent Dynamic Swarm (IDS)

Ask authors/readers for more resources

Data mining is the most commonly used name to solve problems by analyzing data already present in databases. Feature selection is an important problem in the emerging field of data mining which is aimed at finding a small set of rules from the training data set with predetermined targets. Many approaches, methods and goals including Genetic Algorithms (GA) and swarm-based approaches have been tried out for feature selection in order to these goals. Furthermore, a new technique which named Particle Swarm Optimization (PSO) has been proved to be competitive with GA in several tasks, mainly in optimization areas. However, there are some shortcomings in PSO such as premature convergence. To overcome these, we propose a new evolutionary algorithm called Intelligent Dynamic Swarm (IDS) that is a modified Particle Swarm Optimization. Experimental results states competitive performance of IDS. Due to less computing for swarm generation, averagely IDS is over 30% faster than traditional PSO. (C) 2010 Elsevier Ltd. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available