The aim of constructive induction (CI) is to transform the original data representation of hard concepts with complex interaction into one that outlines the relation among attributes. CI methods based on greedy search suffer from the local optima problem because of high variation in the search space of hard learning problems. To reduce the local optima problem, we propose a CI method based on genetic (evolutionary) algorithms. The method comprises two integrated genetic algorithms to construct functions over subsets of attributes in order to highlight regularities for the learner. Using non-algebraic representation for constructed functions assigns an equal degree of complexity to functions. This reduces the difficulty of constructing complex features. Experiments show that our method is comparable with and in some cases superior to existing CI methods. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Shafti, L. S., & Pérez, E. (2003). Genetic approach to constructive induction based on non-algebraic feature representation. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2810, 599–610. https://doi.org/10.1007/978-3-540-45231-7_55
Mendeley helps you to discover research relevant for your work.