Discovering new rule induction algorithms with grammar-based genetic programming

3Citations
Citations of this article
25Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Rule induction is a data mining technique used to extract classification rules of the form IF (conditions) THEN (predicted class) from data. The majority of the rule induction algorithms found in the literature follow the sequential covering strategy, which essentially induces one rule at a time until (almost) all the training data is covered by the induced rule set. This strategy describes a basic algorithm composed by several key elements, which can be modified and/or extended to generate new and better rule induction algorithms. With this in mind, this work proposes the use of a grammar-based genetic programming (GGP) algorithm to automatically discover new sequential covering algorithms. The proposed system is evaluated using 20 data sets, and the automatically-discovered rule induction algorithms are compared with four well-known human-designed rule induction algorithms. Results showed that the GGP system is a promising approach to effectively discover new sequential covering algorithms. © 2008 Springer-Verlag US.

Cite

CITATION STYLE

APA

Pappa, G. L., & Freitas, A. A. (2008). Discovering new rule induction algorithms with grammar-based genetic programming. In Soft Computing for Knowledge Discovery and Data Mining (pp. 133–152). Springer US. https://doi.org/10.1007/978-0-387-69935-6_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free