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. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Chen, S., & Yuan, X. (2008). Study on discretization in rough set via modified quantum genetic algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5227 LNAI, pp. 300–307). https://doi.org/10.1007/978-3-540-85984-0_37
Mendeley helps you to discover research relevant for your work.