Rough set knowledge reduction algorithm based on chaos genetic algorithm

摘要

In order to obtain a valid property smallest relative reduction, this article proposed a sort of rough set knowledge reduction algorithm based on chaos genetic algorithm. The algorithm loads the chaotic variable in population genetic algorithm, making minor disturbances to progeny groups with chaos variables and adjusting perturbation amplitude gradually in the searching process to make the new algorithms not only enhancing the local search capability but also maintain the characteristics of the global optimization algorithm. At last verified by one classic example, it achieved good results whether in accuracy of reduction or in average run algebra.