IRMA-International.org: Creator of Knowledge
Information Resources Management Association
Advancing the Concepts & Practices of Information Resources Management in Modern Organizations

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

Recursive Learning of Genetic Algorithms with Task Decomposition and Varied Rule Set
View Sample PDF
Author(s): Lei Fang (Xi’an Jiaotong-Liverpool University, China), Sheng-Uei Guan (Xi’an Jiaotong-Liverpool University, China)and Haofan Zhang (Xi’an Jiaotong-Liverpool University, China)
Copyright: 2013
Pages: 22
Source title: Modeling Applications and Theoretical Innovations in Interdisciplinary Evolutionary Computation
Source Author(s)/Editor(s): Wei-Chiang Samuelson Hong (Oriental Institute of Technology, Taiwan)
DOI: 10.4018/978-1-4666-3628-6.ch014

Purchase

View Recursive Learning of Genetic Algorithms with Task Decomposition and Varied Rule Set on the publisher's website for pricing and purchasing information.

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.

Related Content

Bhargav Naidu Matcha, Sivakumar Sivanesan, K. C. Ng, Se Yong Eh Noum, Aman Sharma. © 2023. 60 pages.
Lavanya Sendhilvel, Kush Diwakar Desai, Simran Adake, Rachit Bisaria, Hemang Ghanshyambhai Vekariya. © 2023. 15 pages.
Jayanthi Ganapathy, Purushothaman R., Ramya M., Joselyn Diana C.. © 2023. 14 pages.
Prince Rajak, Anjali Sagar Jangde, Govind P. Gupta. © 2023. 14 pages.
Mustafa Eren Akpınar. © 2023. 9 pages.
Sreekantha Desai Karanam, Krithin M., R. V. Kulkarni. © 2023. 34 pages.
Omprakash Nayak, Tejaswini Pallapothala, Govind P. Gupta. © 2023. 19 pages.
Body Bottom