An innovative application of a constrained-syntax genetic programming system to the problem of predicting survival of patients

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

Abstract

This paper proposes a constrained-syntax genetic programming (GP) algorithm for discovering classification rules in medical data sets. The proposed GP contains several syntactic constraints to be enforced by the system using a disjunctive normal form representation, so that individuals represent valid rule sets that are easy to interpret. The GP is compared with C4.5 in a real-world medical data set. This data set represents a difficult classification problem, and a new preprocessing method was devised for mining the data. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Bojarczuk, C. C., Lopes, H. S., & Freitas, A. A. (2003). An innovative application of a constrained-syntax genetic programming system to the problem of predicting survival of patients. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2610, 11–21. https://doi.org/10.1007/3-540-36599-0_2

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