Improved intelligent dynamic swarm PSO algorithm and rough set for feature selection

3Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Feature Selection is one of the most important preprocessing steps in the field of Data Mining in handling dimensionality problems. It produces a smallest set of rules from the training data set with predetermined targets. Various techniques like Genetic Algorithm, Rough set, Swarm based approaches have been applied for Feature Selection (FS). Particle swarm Optimization was proved to be a competitive technique for FS. However it has certain limitations like premature convergence which is resolved by Intelligent Dynamic Swarm (IDS) algorithm. IDS could produce the reduct set in a smaller time complexity but lacks the accuracy. In this paper we propose an improvised algorithm of IDS for feature selection. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Anuradha, J., & Tripathy, B. K. (2012). Improved intelligent dynamic swarm PSO algorithm and rough set for feature selection. In Communications in Computer and Information Science (Vol. 270 CCIS, pp. 110–119). https://doi.org/10.1007/978-3-642-29216-3_13

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free