Welcome to the InfoSci Platform
Reference Hub4
Recursive Learning of Genetic Algorithms with Task Decomposition and Varied Rule Set

Recursive Learning of Genetic Algorithms with Task Decomposition and Varied Rule Set

Lei Fang, Sheng-Uei Guan, Haofan Zhang
Copyright: © 2011 |Volume: 2 |Issue: 4 |Pages: 24
ISSN: 1942-3594|EISSN: 1942-3608|EISBN13: 9781613505564|DOI: 10.4018/jaec.2011100101
Cite Article Cite Article

MLA

Fang, Lei, et al. "Recursive Learning of Genetic Algorithms with Task Decomposition and Varied Rule Set." IJAEC vol.2, no.4 2011: pp.1-24. http://doi.org/10.4018/jaec.2011100101

APA

Fang, L., Guan, S., & Zhang, H. (2011). Recursive Learning of Genetic Algorithms with Task Decomposition and Varied Rule Set. International Journal of Applied Evolutionary Computation (IJAEC), 2(4), 1-24. http://doi.org/10.4018/jaec.2011100101

Chicago

Fang, Lei, Sheng-Uei Guan, and Haofan Zhang. "Recursive Learning of Genetic Algorithms with Task Decomposition and Varied Rule Set," International Journal of Applied Evolutionary Computation (IJAEC) 2, no.4: 1-24. http://doi.org/10.4018/jaec.2011100101

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Rule-based Genetic Algorithms (GAs) have been used in the application of pattern classification (Corcoran & Sen, 1994), but conventional GAs have weaknesses. First, the time spent on learning is long. Moreover, the classification accuracy achieved by a GA is not satisfactory. These drawbacks are due to existing undesirable features embedded in conventional GAs. The number of rules within the chromosome of a GA classifier is usually set and fixed before training and is not problem-dependent. Secondly, conventional approaches train the data in batch without considering whether decomposition solves the problem. Thirdly, when facing large-scale real-world problems, GAs cannot utilise resources efficiently, leading to premature convergence. Based on these observations, this paper develops a novel algorithmic framework that features automatic domain and task decomposition and problem-dependent chromosome length (rule number) selection to resolve these undesirable features. The proposed Recursive Learning of Genetic Algorithm with Task Decomposition and Varied Rule Set (RLGA) method is recursive and trains and evolves a team of learners using the concept of local fitness to decompose the original problem into sub-problems. RLGA performs better than GAs and other related solutions regarding training duration and generalization accuracy according to the experimental results.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.