Open AccessA Comparative Study on the Performance of Gene Expression Programming and Machine Learning Methods
Author(s) -
Mohammad Anas,
Mohsin Khan,
Hammad Basit
Publication year - 2021
Publication title -
international journal of scientific research in science and technology
Language(s) - English
Resource type - Journals
eISSN - 2395-602X
pISSN - 2395-6011
DOI - 10.32628/ijsrset1218226
Subject(s) - gene expression programming , computer science , variance (accounting) , genetic programming , dependency (uml) , machine learning , artificial intelligence , regression , evolutionary algorithm , decision tree , polynomial , data mining , mathematics , statistics , mathematical analysis , accounting , business
Usually, evolutionary algorithms are used to provide strong approximations to problems that are difficult to solve with other methods. Gene expression programming (GEP) is a type of evolutionary algorithm used in computer programming to generate computer programs or models. These computer programs are complex tree structures that, like a living organism, learn and adapt by modifying their sizes, shapes, and composition. In the present work, a comparison study was made among GEP and the standard prediction techniques to find the best predicting model on the BOSTON HOUSING dataset. Three approaches viz. GEP, ANN and polynomial regression were implemented on the dataset. The study showed how the three methods solve the problem of high bias and high variance and which one outperforms the other. The research work, however, gave a glimpse of the actual limitations and advantages of the methods on one another indicating the dependency of method on the type of data used. The results conclude the comparison of different methods on different performance metrics. The GEP model however reduced the problem of high bias and high variance by giving a slight difference between the train and test accuracy but was not able to outperform ANN and polynomial regression in terms of performance metrics.