Evolutionary computation

  • Authors:
  • Alex Alves Freitas

  • Affiliations:
  • Associate Professor of Computer Science, Pontificia Universidade Catolica do Parana, Programa de Pos-Graduacao em Informatica Aplicada, Curitiba, Brazil

  • Venue:
  • Handbook of data mining and knowledge discovery
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

This chapter addresses the integration of knowledge discovery in databases (KDD) and evolutionary algorithms (EAs), particularly genetic algorithms and genetic programming. First, we provide a brief overview of EAs. Then the remaining text is divided into three parts. Section 2 discusses the use of EAs for KDD. The emphasis is on the use of EAs for discovering high-level prediction rules, but we also discuss the use of EAs in attribute selection and in the optimization of parameters for other kinds of KDD algorithms (such as decision trees and nearest neighbor algorithms). Section 3 discusses three research problems in the design of an EA for KDD, namely, how to discover comprehensible rules with genetic programming, how to discover surprising (interesting) rules, and how to scale up EAs with parallel processing. Finally, Section 4 discusses what the added value of KDD is for EAs. This section includes the remark that generalization performance on a separate test set (unseen during training, or EA run) is a basic principle for evaluating the quality of discovered knowledge, and then suggests that this principle should be followed in other EA applications.