Genetic Programming with Random Binary Decomposition for Multi-Class Classification Problems

Author(s):  
Lushen Liao ◽  
Adam Kotaro Pindur ◽  
Hitoshi Iba
2021 ◽  
Vol 13 (9) ◽  
pp. 1623
Author(s):  
João E. Batista ◽  
Ana I. R. Cabral ◽  
Maria J. P. Vasconcelos ◽  
Leonardo Vanneschi ◽  
Sara Silva

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.


Author(s):  
Kanae Takahashi ◽  
Kouji Yamamoto ◽  
Aya Kuchiba ◽  
Tatsuki Koyama

AbstractA binary classification problem is common in medical field, and we often use sensitivity, specificity, accuracy, negative and positive predictive values as measures of performance of a binary predictor. In computer science, a classifier is usually evaluated with precision (positive predictive value) and recall (sensitivity). As a single summary measure of a classifier’s performance, F1 score, defined as the harmonic mean of precision and recall, is widely used in the context of information retrieval and information extraction evaluation since it possesses favorable characteristics, especially when the prevalence is low. Some statistical methods for inference have been developed for the F1 score in binary classification problems; however, they have not been extended to the problem of multi-class classification. There are three types of F1 scores, and statistical properties of these F1 scores have hardly ever been discussed. We propose methods based on the large sample multivariate central limit theorem for estimating F1 scores with confidence intervals.


2014 ◽  
Vol 519-520 ◽  
pp. 644-650
Author(s):  
Mian Shui Yu ◽  
Yu Xie ◽  
Xiao Meng Xie

Age classification based on facial images is attracting wide attention with its broad application to human-computer interaction (HCI). Since human senescence is a tremendously complex process, age classification is still a highly challenging issue. In our study, Local Directional Pattern (LDP) and Gabor wavelet transform were used to extract global and local facial features, respectively, that were fused based on information fusion theory. The Principal Component Analysis (PCA) method was used for dimensionality reduction of the fused features, to obtain a lower-dimensional age characteristic vector. A Support Vector Machine (SVM) multi-class classifier with Error Correcting Output Codes (ECOC) was proposed in the paper. This was aimed at multi-class classification problems, such as age classification. Experiments on a public FG-NET age database proved the efficiency of our method.


This chapter presents the computer implementation of the tree-based genetic programming in C# programming language. Since C# is a common object-oriented programming language, with little modification the source code presented in the chapter can be easily transformed into Java or C++ programming languages. The chapter covers all aspects of the implementation: node, chromosome, population, function set, and terminal set class implementations. The chapter is carefully structured, so at the end of the chapter fully working GP computer program will be implemented which can solve regression and multiclass classification problems. The reader should not worry about specific operating system, or development environment, since all code implementations are based on cross-OS and open source integrated development environment visual studio code which can run on Windows, Mac, or Linux.


Author(s):  
JIA LV ◽  
NAIYANG DENG

Local learning has been successfully applied to transductive classification problems. In this paper, it is generalized to multi-class classification of transductive learning problems owing to its good classification ability. Meanwhile, there is essentially no ordinal meaning in class label of multi-class classification, and it belongs to discrete nominal variable. However, common binary series class label representation has the equal distance from one class to another, and it does not reflect the sparse and density relationship among classes distribution, so a learning and adjustable nominal class label representation method is presented. Experimental results on a set of benchmark multi-class datasets show the superiority of our algorithm.


Sign in / Sign up

Export Citation Format

Share Document