Feature Selection based on Rough Sets and Particle Swarm Optimization


Show simple item record

dc.contributor.author Yang, Jie
dc.contributor.author Xia, W.
dc.contributor.author Wang, Xiangyang
dc.contributor.author Jensen, Richard
dc.contributor.author Teng, X.
dc.date.accessioned 2007-12-03T16:25:24Z
dc.date.available 2007-12-03T16:25:24Z
dc.date.issued 2007
dc.identifier.citation Yang , J , Xia , W , Wang , X , Jensen , R & Teng , X 2007 , ' Feature Selection based on Rough Sets and Particle Swarm Optimization ' Pattern Recognition Letters , pp. 459-471 . , 10.1016/j.patrec.2006.09.003 en
dc.identifier.other PURE: 73228
dc.identifier.other dspace: 2160/382
dc.identifier.uri http://hdl.handle.net/2160/382
dc.description X. Wang, J. Yang, X. Teng, W. Xia, and R. Jensen. Feature Selection based on Rough Sets and Particle Swarm Optimization. Pattern Recognition Letters, vol. 28, no. 4, pp. 459-471, 2007. en
dc.description.abstract We propose a new feature selection strategy based on rough sets and Particle Swarm Optimization (PSO). Rough sets has been used as a feature selection method with much success, but current hill-climbing rough set approaches to feature selection are inadequate at finding optimal reductions as no perfect heuristic can guarantee optimality. On the other hand, complete searches are not feasible for even medium-sized datasets. So, stochastic approaches provide a promising feature selection mechanism. Like Genetic Algorithms, PSO is a new evolutionary computation technique, in which each potential solution is seen as a particle with a certain velocity flying through the problem space. The Particle Swarms find optimal regions of the complex search space through the interaction of individuals in the population. PSO is attractive for feature selection in that particle swarms will discover best feature combinations as they fly within the subset space. Compared with GAs, PSO does not need complex operators such as crossover and mutation, it requires only primitive and simple mathematical operators, and is computationally inexpensive in terms of both memory and runtime. Experimentation is carried out, using UCI data, which compares the proposed algorithm with a GA-based approach and other deterministic rough set reduction algorithms. The results show that PSO is efficient for rough set-based feature selection. en
dc.format.extent 13 en
dc.language.iso eng
dc.relation.ispartof Pattern Recognition Letters en
dc.title Feature Selection based on Rough Sets and Particle Swarm Optimization en
dc.type Text en
dc.type.publicationtype Article (Journal) en
dc.identifier.doi http://dx.doi.org/10.1016/j.patrec.2006.09.003
dc.contributor.institution Department of Computer Science en
dc.contributor.institution Advanced Reasoning Group en
dc.description.status Peer reviewed en

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search Cadair

Advanced Search


My Account