Econometric Genetic Programming in Binary Classification: Evolving Logistic Regressions Through Genetic Programming

2017 ◽  
pp. 382-394 ◽  
Author(s):  
André Luiz Farias Novaes ◽  
Ricardo Tanscheit ◽  
Douglas Mota Dias
Keyword(s):  
Genetic Programming ◽  
Binary Classification ◽  
Logistic Regressions

scholarly journals Improving Land Cover Classification Using Genetic Programming for Feature Construction

2021 ◽  
Vol 13 (9) ◽  
pp. 1623
Author(s):  
João E. Batista ◽  
Ana I. R. Cabral ◽  
Maria J. P. Vasconcelos ◽  
Leonardo Vanneschi ◽  
Sara Silva
Keyword(s):  
Land Cover ◽  
Genetic Programming ◽  
Satellite Images ◽  
State Of The Art ◽  
Binary Classification ◽  
Feature Construction ◽  
Classification Problems ◽  
Construction Methods ◽  
Box Models

Genetic programming (GP) is a powerful machine learning (ML) algorithm that can produce readable white-box models. Although successfully used for solving an array of problems in different scientific areas, GP is still not well known in the field of remote sensing. The M3GP algorithm, a variant of the standard GP algorithm, performs feature construction by evolving hyperfeatures from the original ones. In this work, we use the M3GP algorithm on several sets of satellite images over different countries to create hyperfeatures from satellite bands to improve the classification of land cover types. We add the evolved hyperfeatures to the reference datasets and observe a significant improvement of the performance of three state-of-the-art ML algorithms (decision trees, random forests, and XGBoost) on multiclass classifications and no significant effect on the binary classifications. We show that adding the M3GP hyperfeatures to the reference datasets brings better results than adding the well-known spectral indices NDVI, NDWI, and NBR. We also compare the performance of the M3GP hyperfeatures in the binary classification problems with those created by other feature construction methods such as FFX and EFS.

scholarly journals Binary Image Classification: A Genetic Programming Approach to the Problem of Limited Training Instances

2016 ◽  
Vol 24 (1) ◽  
pp. 143-182 ◽  
Author(s):  
Harith Al-Sahaf ◽  
Mengjie Zhang ◽  
Mark Johnston
Keyword(s):  
Computer Vision ◽  
Pattern Recognition ◽  
Genetic Programming ◽  
Visual System ◽  
Image Classification ◽  
Human Visual System ◽  
Binary Classification ◽  
Programming Approach ◽  
Data Sets ◽  
New Class

In the computer vision and pattern recognition fields, image classification represents an important yet difficult task. It is a challenge to build effective computer models to replicate the remarkable ability of the human visual system, which relies on only one or a few instances to learn a completely new class or an object of a class. Recently we proposed two genetic programming (GP) methods, one-shot GP and compound-GP, that aim to evolve a program for the task of binary classification in images. The two methods are designed to use only one or a few instances per class to evolve the model. In this study, we investigate these two methods in terms of performance, robustness, and complexity of the evolved programs. We use ten data sets that vary in difficulty to evaluate these two methods. We also compare them with two other GP and six non-GP methods. The results show that one-shot GP and compound-GP outperform or achieve results comparable to competitor methods. Moreover, the features extracted by these two methods improve the performance of other classifiers with handcrafted features and those extracted by a recently developed GP-based method in most cases.

scholarly journals Binary image classification: A genetic programming approach to the problem of limited training instances

2020 ◽  
Author(s):  
Harith Al-Sahaf ◽  
Mengjie Zhang ◽  
M Johnston
Keyword(s):  
Pattern Recognition ◽  
Genetic Programming ◽  
Image Classification ◽  
Binary Classification ◽  
Programming Approach ◽  
Data Sets ◽  
Massachusetts Institute ◽  
Massachusetts Institute Of Technology ◽  
New Class ◽  
Institute Of Technology

© 2016 by the Massachusetts Institute of Technology. In the computer vision and pattern recognition fields, image classification represents an important yet difficult task. It is a challenge to build effective computer models to replicate the remarkable ability of the human visual system, which relies on only one or a few instances to learn a completely new class or an object of a class. Recently we proposed two genetic programming (GP) methods, one-shot GP and compound-GP, that aim to evolve a program for the task of binary classification in images. The two methods are designed to use only one or a few instances per class to evolve the model. In this study, we investigate these two methods in terms of performance, robustness, and complexity of the evolved programs. We use ten data sets that vary in difficulty to evaluate these two methods. We also compare them with two other GP and six non-GP methods. The results show that one-shot GP and compound-GP outperform or achieve results comparable to competitor methods. Moreover, the features extracted by these two methods improve the performance of other classifiers with handcrafted features and those extracted by a recently developed GP-based method in most cases.

High-dimensional Unbalanced Binary Classification by Genetic Programming with Multi-criterion Fitness Evaluation and Selection

2021 ◽  
pp. 1-26
Author(s):  
Wenbin Pei ◽  
Bing Xue ◽  
Lin Shang ◽  
Mengjie Zhang
Keyword(s):  
Genetic Programming ◽  
Fitness Function ◽  
Binary Classification ◽  
Class Imbalance ◽  
Area Under The Curve ◽  
High Dimensional ◽  
Genetic Operators ◽  
Minority Class ◽  
Fitness Evaluation ◽  
Unbalanced Classification

Abstract High-dimensional unbalanced classification is challenging because of the joint effects of high dimensionality and class imbalance. Genetic programming (GP) has the potential benefits for use in high-dimensional classification due to its built-in capability to select informative features. However, once data is not evenly distributed, GP tends to develop biased classifiers which achieve a high accuracy on the majority class but a low accuracy on the minority class. Unfortunately, the minority class is often at least as important as the majority class. It is of importance to investigate how GP can be effectively utilized for high-dimensional unbalanced classification. In this paper, to address the performance bias issue of GP, a new two-criterion fitness function is developed, which considers two criteria, i.e. the approximation of area under the curve (AUC) and the classification clarity (i.e. how well a program can separate two classes). The obtained values on the two criteria are combined in pairs, instead of summing them together. Furthermore, this paper designs a three-criterion tournament selection to effectively identify and select good programs to be used by genetic operators for generating better offspring during the evolutionary learning process. The experimental results show that the proposed method achieves better classification performance than other compared methods.

A novel binary classification approach based on geometric semantic genetic programming

2021 ◽  
pp. 101028
Author(s):  
I. Bakurov ◽  
M. Castelli ◽  
A. Scotto di Freca ◽  
L. Vanneschi ◽  
F. Fontanella
Keyword(s):  
Genetic Programming ◽  
Binary Classification ◽  
Classification Approach

scholarly journals Improving Land Cover Classification Using Genetic Programming for Feature Construction

2020 ◽  
Author(s):  
João Batista ◽  
Ana Cabral ◽  
Maria Vasconcelos ◽  
Leonardo Vanneschi ◽  
Sara Silva
Keyword(s):  
Land Cover ◽  
Genetic Programming ◽  
Satellite Images ◽  
State Of The Art ◽  
Binary Classification ◽  
Feature Construction ◽  
Classification Problems ◽  
Construction Methods ◽  
Box Models

Genetic Programming (GP) is a powerful Machine Learning (ML) algorithm that can produce readable white-box models. Although successfully used for solving an array of problems in different scientific areas, GP is still not well known in Remote Sensing. The M3GP algorithm, a variant of the standard GP algorithm, performs Feature Construction by evolving hyper-features from the original ones. In this work, we use the M3GP algorithm on several sets of satellite images over different countries to create hyper-feature from satellite bands to improve the classification of land cover types. We add the evolved hyper-features to the reference datasets and observe a significant improvement of the performance of three state-of-the-art ML algorithms (Decision Trees, Random Forests and XGBoost) on multiclass classifications and no significant effect on the binary classifications. We show that adding the M3GP hyper-features to the reference datasets brings better results than adding the well-known spectral indices NDVI, NDWI and NBR. We also compare the performance of the M3GP hyper-features in the binary classification problems with those created by other Feature Construction methods like FFX and EFS.

scholarly journals Improving Land Cover Classification Using Genetic Programming

2020 ◽  
Author(s):  
João Batista ◽  
Ana Cabral ◽  
Maria Vasconcelos ◽  
Leonardo Vanneschi ◽  
Sara Silva
Keyword(s):  
Land Cover ◽  
Genetic Programming ◽  
Binary Classification ◽  
Multiclass Classification ◽  
Feature Construction ◽  
Classification Problems ◽  
Construction Methods ◽  
Box Models ◽  
Burnt Areas

Genetic Programming (GP) is a powerful Machine Learning (ML) algorithm that can produce readable white-box models. Although successfully used for solving an array of problems in different scientific areas, GP is still not well known in Remote Sensing. The M3GP algorithm, a variant of the standard GP algorithm, performs Feature Construction by evolving hyper-features from the original ones. In this work, we use the M3GP algorithm on several satellite images over different countries to perform binary classification of burnt areas and multiclass classification of land cover types. We add the evolved hyper-features to the reference datasets and observe a significant improvement of the performance of three state-of-the-art ML algorithms (Decision Trees, Random Forests and XGBoost) on the multiclass classification datasets, with no significant effect on the binary classification ones. We show that adding the M3GP hyper-features to the reference datasets brings better results than adding the well-known spectral indices NDVI, NDWI and NBR. We also compare the performance of the M3GP hyper-features in the binary classification problems with those created by other Feature Construction methods like FFX and EFS.

scholarly journals Improving Land Cover Classification Using Genetic Programming for Feature Construction

2020 ◽  
Author(s):  
João E. Batista ◽  
Ana I. R. Cabral ◽  
Maria J. P. Vasconcelos ◽  
Leonardo Vanneschi ◽  
Sara Silva
Keyword(s):  
Land Cover ◽  
Genetic Programming ◽  
Satellite Images ◽  
State Of The Art ◽  
Binary Classification ◽  
Feature Construction ◽  
Classification Problems ◽  
Construction Methods ◽  
Box Models

Genetic Programming (GP) is a powerful Machine Learning (ML) algorithm that can produce readable white-box models. Although successfully used for solving an array of problems in different scientific areas, GP is still not well known in Remote Sensing. The M3GP algorithm, a variant of the standard GP algorithm, performs Feature Construction by evolving hyper-features from the original ones. In this work, we use the M3GP algorithm on several sets of satellite images over different countries to create hyper-feature from satellite bands to improve the classification of land cover types. We add the evolved hyper-features to the reference datasets and observe a significant improvement of the performance of three state-of-the-art ML algorithms (Decision Trees, Random Forests and XGBoost) on multiclass classifications and no significant effect on the binary classifications. We show that adding the M3GP hyper-features to the reference datasets brings better results than adding the well-known spectral indices NDVI, NDWI and NBR. We also compare the performance of the M3GP hyper-features in the binary classification problems with those created by other Feature Construction methods like FFX and EFS.

Genetic Programming Applications in Solving Engineering Problems

2018 ◽  
pp. 243-279
Keyword(s):  
Time Series ◽  
Impact Toughness ◽  
Genetic Programming ◽  
Input Data ◽  
Welded Joint ◽  
Binary Classification ◽  
Forecasting Model ◽  
Prediction Problem ◽  
The Third ◽  
Classification Prediction

This chapter explains how to use genetic programming to solve various kinds of problems in different engineering fields. Here, three applications, each of which relevant to a distinct engineering field, are explained. First, the chapter starts with the GP application in mechanical engineering. The application analyzes the use of GP in modelling impact toughness of welded joint components. The experimental results of impact toughness represent the input data to build GP models of each welded joint component individually. The second part of the chapter shows how two recent versions of GPdotNET can be satisfactorily used for a binary classification-prediction problem in civil engineering. This application puts forward a new classification-forecasting model, namely binary GP for teleconnection studies between oceanic and heavily local hydrologic variables. Finally, the third application demonstrates how GP could be applied to solve a time series forecasting problem in the field of electrical engineering.

Sign in / Sign up

Export Citation Format

Share Document