Predictive and comprehensible rule discovery using a multi-objective genetic algorithm

作者:

Highlights:

摘要

We present a multi-objective genetic algorithm for mining highly predictive and comprehensible classification rules from large databases. We emphasize predictive accuracy and comprehensibility of the rules. However, accuracy and comprehensibility of the rules often conflict with each other. This makes it an optimization problem that is very difficult to solve efficiently. We have proposed a multi-objective evolutionary algorithm called improved niched Pareto genetic algorithm (INPGA) for this purpose. We have compared the rule generation by INPGA with that by simple genetic algorithm (SGA) and basic niched Pareto genetic algorithm (NPGA). The experimental result confirms that our rule generation has a clear edge over SGA and NPGA.

论文关键词:Simple genetic algorithm,Pareto optimal solutions,Niched Pareto genetic algorithm,Data mining

论文评审过程:Received 21 January 2005, Accepted 23 March 2006, Available online 23 June 2006.

论文官网地址:https://doi.org/10.1016/j.knosys.2006.03.004