Study on discretization in rough set based on genetic algorithm

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

Abstract

Discretization of attributes with real values in rough set is an important problem in data mining. It is different from the traditional discretization which has particular characteristic. Nguyen S. H. has given a detailed description about discretization in rough set. This paper gives a genetic algorithm aimed at discretization proposed by Nguyen S. H. And at the same time we make an experiment on several datasets from UCI Machine Learning Repository by this method. During the experiment, we constantly optimized genetic algorithm by adopting some optimization strategies. The experiment has proved that using genetic algorithm to solve discretization of rough set is efficient whatever in time complexity or in accuracy.

Cite

CITATION STYLE

APA

Chen, C. Y., Li, Z. G., Qiao, S. Y., & Wen, S. P. (2003). Study on discretization in rough set based on genetic algorithm. In International Conference on Machine Learning and Cybernetics (Vol. 3, pp. 1430–1434). https://doi.org/10.1109/icmlc.2003.1259717

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