تعداد نشریات | 161 |
تعداد شمارهها | 6,573 |
تعداد مقالات | 71,037 |
تعداد مشاهده مقاله | 125,520,884 |
تعداد دریافت فایل اصل مقاله | 98,780,453 |
- | ||
بین المللی علوم (منتشر نمی شود) | ||
مقاله 3، دوره 6، شماره 0 - شماره پیاپی 1375، مهر 1384 اصل مقاله (348.64 K) | ||
نویسندگان | ||
R. Mall؛ S. Dehuri* | ||
عنوان مقاله [English] | ||
- | ||
چکیده [English] | ||
We present a multi-objective genetic algorithm for mining highly predictive and comprehensible classification rules from large data-bases. 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 | ||
کلیدواژهها [English] | ||
Data Mining, Niched Pareto genetic algorithm, Pareto optimal solutions, Simple genetic algorithm | ||
آمار تعداد مشاهده مقاله: 1,667 تعداد دریافت فایل اصل مقاله: 1,694 |