Study on discretization in rough set based on genetic algorithm
暂无分享,去创建一个
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.
[1] Z Xu. ALMOST SURE STRONG CONVERGENCE OF A CLASS OF GENETIC ALGORITHMS WITH PARENT-OFFSPRINGS COMPETITION , 2002 .
[2] Yuan-Xiang Li,et al. Study on discretization based on rough set theory , 2002, Proceedings. International Conference on Machine Learning and Cybernetics.
[3] Andrzej SkowronInstitute,et al. QUANTIZATION OF REAL VALUE ATTRIBUTESRough Set and Boolean Reasoning , 1995 .