Co-evolutionary rule-chaining genetic programming

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

Abstract

A novel Genetic Programming (GP) paradigm called Co-evolutionary Rule-Chaining Genetic Programming (CRGP) has been proposed to learn the relationships among attributes represented by a set of classification rules for multi-class problems. It employs backward chaining inference to carry out classification based on the acquired acyclic rule set. Its main advantages are: 1) it can handle more than one class at a time; 2) it avoids cyclic result; 3) unlike Bayesian Network (BN), the CRGP can handle input attributes with continuous values directly; and 4) with the flexibility of GP, CRGP can learn complex relationship. We have demonstrated its better performance on one synthetic and one real-life medical data sets. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Shum, W. H., Leung, K. S., & Wong, M. L. (2005). Co-evolutionary rule-chaining genetic programming. In Lecture Notes in Computer Science (Vol. 3578, pp. 546–554). Springer Verlag. https://doi.org/10.1007/11508069_71

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