Feature Selection With Intelligent Dynamic Swarm And Rough Set

Pergamon-Elsevier Science Ltd
Publication Type:
Journal Article
Expert Systems with Applications, 2010, 37 (10), pp. 7026 - 7032
Issue Date:
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2010004093OK.pdf303.84 kB
Adobe PDF
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.
Please use this identifier to cite or link to this item: