Dynamic Programming Inspired Genetic Programming to Solve Regression Problems
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2017, Vol 8, Issue 4
Abstract
The candidate solution in traditional Genetic Pro-graming is evolved through prescribed number of generations using fitness measure. It has been observed that, improvement of GP on different problems is insignificant at later generations. Furthermore, GP struggles to evolve on some symbolic regression problems due to high selective pressure, where input range is very small, and few generations are allowed. In such scenarios stagnation of GP occurs and GP cannot evolve a desired solution. Recent works address these issues by using single run to reduce residual error which is based on semantic concept. A new approach is proposed called Dynamic Decomposition of Genetic Programming (DDGP) inspired by dynamic programing. DDGP decomposes a problem into sub problems and initiates sub runs in order to find sub solutions. The algebraic sum of all the sub solutions merge into an overall solution, which provides the desired solution. Experiments conducted on well known benchmarks with varying complexities, validates the proposed approach, as the empirical results of DDGP are far superior to the standard GP. Moreover, statistical analysis has been conducted using T test, which depicted significant difference on eight datasets. Symbolic regression problems where other variants of GP stagnates and cannot evolve the required solution, DDGP is highly recommended for such symbolic regression problems.
Authors and Affiliations
Asim Darwaish, Hammad Majeed, M. Quamber Ali, Abdul Rafay
Keywords
Related Articles
- EP ID EP258399
- DOI 10.14569/IJACSA.2017.080463
- Views 82
- Downloads 0
Priority-Aware Virtual Machine Selection Algorithm in Dynamic Consolidation
In the past few years, many researchers attempted to tackle the problem of decreasing energy consumption in cloud data centers. One of the widely adopted techniques for this purpose is dynamic Virtual Machine (VM) consol...
Automatic Classification and Segmentation of Brain Tumor in CT Images using Optimal Dominant Gray level Run length Texture Features
Tumor classification and segmentation from brain computed tomography image data is an important but time consuming task performed manually by medical experts. Automating this process is challenging due to the high divers...
All in Focus Image Generation based on New Focusing Measure Operators
To generate an all in focus image, the Shape-From-Focus (SFF) is used. The SFF key is finding the optimal focus depth at each pixel or area in an image within sequence of images. In this paper two new focusing measure op...
TPACK Adaptation among Faculty Members of Education and ICT Departments in University of Sindh, Pakistan
Technological Pedagogical Content Knowledge (TPACK) framework has been to investigate the technological and instructive knowledge of teachers. Many researchers have found this framework a useful tool to explore teachers’...
Experimental Analysis of the Fault Tolerance of the PIM-SM IP Multicast Routing Protocol under GNS3
PIM-SM is the most commonly used IP multicast routing protocol in IPTV systems. Its fault tolerance is examined by experimenting on a mesh topology multicast test network built up by Cisco routers under GNS3. Different f...