A new rough set reduct algorithm based on particle swarm optimization

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

Abstract

Finding appropriate features is one of the key problems in the increasing applications of rough set theory, which is also one of the bottlenecks of the rough set methodology. Particle Swarm Optimization (PSO) is particularly attractive for this challenging problem. In this paper, we attempt to solve the problem using a particle swarm optimization approach. The proposed approach discover the best feature combinations in an efficient way to observe the change of positive region as the particles proceed through the search space. We evaluate the performance of the proposed PSO algorithm with Genetic Algorithm (GA). Empirical results indicate that the proposed algorithm could be an ideal approach for solving the feature reduction problem when other algorithms failed to give a better solution. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Yue, B., Yao, W., Abraham, A., Teng, H., & Liu, H. (2007). A new rough set reduct algorithm based on particle swarm optimization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4527 LNCS, pp. 397–406). Springer Verlag. https://doi.org/10.1007/978-3-540-73053-8_40

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