Study on Discretization in Rough Set Via Modified Quantum Genetic Algorithm

Authors:
Shuhong Chen;Xiaofeng Yuan
Affiliations:
, Beijing, P.R. China 100085;, Beijing, P.R. China 100085
Venue:
ICIC '08 Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence
Year:
2008

Citing 1
Cited 2

A Modified Chi2 Algorithm for Discretization

IEEE Transactions on Knowledge and Data Engineering

Rough sets in the Soft Computing environment

Information Sciences: an International Journal
Compact classification of optimized Boolean reasoning with Particle Swarm Optimization

Intelligent Data Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

Optimal discretization of real valued attributes in rough set is a problem of NP-complete. To resolve this problem, a modified quantum genetic algorithm (MQGA) and a new parametric configuration scheme for the fitness function are proposed in this paper. In MQGA, a novel technique with locally hierarchical search ability is introduced to speed up the convergence of QGA. With this configuration scheme, it is convenient to distinguish the appropriate solutions that partition the new decision table consistently from all the results. Experiments on dataset of Iris have demonstrated that the proposed MQGA is more preferable compared with the traditional GA-based method and QGA based method in terms of execution time and ability to obtain the optimal solution.