Wróblewski J., 1995. Finding minimal reducts using genetic algorithms. Proc. of the Second Annual Join Conference on Information Sciences, pp.186-189, September 28-October 1, 1995, Wrightsville Beach, NC. Also in: ICS Research report 16/95, Warsaw University of Technology.
ABSTRACT
An application of three types of genetic algorithm to short reducts finding is presented. The first mehtod: classical genetic algorithm with individuals represented by bit strings, appeared to be fast, but sometimes fails to find the global optimum. The second and third method bases on permutational coding and "greedy" algorithms. The results are much better, but the computation time increases.