Find Minimal Reduces Using a Novel Survival of the Fittest Genetic Algorithm

Rough sets theory is emerging as a powerful tool as inducing knowledge classification knowledge from database.Central to this technique is the problem of searching for a reduct which is a minimal subset of information that has the same ability to classify data as when the full set of information is used.In this paper,we present a new method of finding minimal reducts using a novel survival of the fittest genetic algorithm.The algorithm can avoid close breeding and the deficiency of selection of crossover and mutation probability in traditional genetic algorithm.The experimental results show that it is well convergent.