Particle Swarm Algorithm for Minimal Attribute Reduction of Decision Data Tables
IMSCCS '06 Proceedings of the First International Multi-Symposiums on Computer and Computational Sciences - Volume 2 (IMSCCS'06) - Volume 02
RSKT'08 Proceedings of the 3rd international conference on Rough sets and knowledge technology
Research on rough set theory and applications in China
Transactions on rough sets VIII
On attribute reduction of rough set based on pruning rules
RSKT'10 Proceedings of the 5th international conference on Rough set and knowledge technology
A new fitness function for solving minimum attribute reduction problem
RSKT'10 Proceedings of the 5th international conference on Rough set and knowledge technology
A novel and better fitness evaluation for rough set based minimum attribute reduction problem
Information Sciences: an International Journal
Immune ant swarm optimization for optimum rough reducts generation
International Journal of Hybrid Intelligent Systems
Hi-index | 0.00 |
Computation of a minimum attribute reduct of a decision table, which is known as an NP-hard nonlinearly constrained optimization problem, is equivalently transformed in this paper into an unconstrained binary optimization problem. An improved binary particle swarm optimization algorithm combined with some immunity mechanism is then proposed to solve the transformed optimization problem. Vaccination based on the discernibility matrix of the decision table is introduced for accelerating the search process in the algorithm. Experimental results on a number of data sets show that the proposed algorithm remarkably outperforms some recent global optimization techniques based algorithms for minimum attribute reduction in both quality of solution and computational complexity.