A Genetic Programming Approach to Binary Classification Problem

80Citations
Citations of this article
68Readers
Mendeley users who have this article in their library.

Abstract

The Binary classification is the most challenging problem in machine learning. One of the most promising technique to solve this problem is by implementing genetic programming (GP). GP is one of Evolutionary Algorithm (EA) that used to solve problems that humans do not know how to solve it directly. The objectives of this research is to demonstrate the use of genetic programming in this type of problems; that is, other types of techniques are typically used, e.g., regression, artificial neural networks. Genetic programming presents an advantage compared to those techniques, which is that it does not need an a priori definition of its structure. The algorithm evolves automatically until finding a model that best fits a set of training data. Feature engineering was considered to improve the accuracy. In this research, feature transformation and feature creation were implemented. Thus, genetic programming can be considered as an alternative option for the development of intelligent systems mainly in the pattern recognition field.

Cite

CITATION STYLE

APA

Santoso, L. W., Singh, B., Rajest, S. S., Regin, R., & Kadhim, K. H. (2021). A Genetic Programming Approach to Binary Classification Problem. EAI Endorsed Transactions on Energy Web, 8(31), 1–8. https://doi.org/10.4108/eai.13-7-2018.165523

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free