Genetic Algorithms in Decomposition and Classification Problems
Jakub Wróblewski · Studies in fuzziness and soft computing · 1998
Some combinatorical problems concerned with using rough set theory in knowledge discovery (KD) and data analysis can be successfully solved using genetic algorithms (GA) — a sophisticated, adaptive search method based on the Darwinian principle of natural selection (see [4], [6]). These problems are frequently NP-hard, as in case of reducts or templates finding (see [12]), and there is no fast and reliable way to solve them in deterministic way.