Abstract
Data classification provides effective solutions to various real-world problems in areas such as disease diagnosis, network intrusion detection, and financial forecasting, among others. Classification algorithms such as induction algorithms, e.g., ID3, and genetic programming are used to produce classifiers. The design of these classification algorithms is time-consuming, requiring many person hours, and is an optimization problem. This chapter examines the automated design of genetic programming as a classification algorithm. The study compares the performance of genetic algorithms and grammatical evolution in automating the design of genetic programming for classifier induction. The performance of the classifiers produced by automated design is compared to that produced by manually designed genetic programming algorithms for binary and multi-class classification in various areas including network intrusion detection and financial forecasting. The automated design required less design time and produced classifiers that performed better than the manually designed classifiers. Grammatical evolution was found to produce better-performing classifiers for binary classification and genetic algorithms for multi-class classification.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
R.C. Barros, M.P. Basgalupp, A. Freitas, A.C.P.L.F. de Carvalho, Evolutonary design of decision-tree algorithms tailored to microarray gene expression data sets. IEEE Trans. Evol. Comput. 18(6), 873–892 (2018)
R.C. Barros, A. de Carvalho, A. Freitas, Automatic Design of Decision-Tree Induction Algorithms (Springer, 2015)
D.E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning (Addison-Wesley, 1989)
B. Komer, J. Bergstra, C. Eliasmith, Hyperopt-sklean, in Automated Machine Learning-Methods, Systems, Challenges (Springer, 2019)
J. Koza, Genetic Programming: On the Programming of Computers by Natural Selection (MIT Press, 1992)
T. Nyathi, Automated Design of Genetic Programming Classification Algorithms using a Genetic Algorithm and Grammatical Evolution. PhD thesis, School of Mathematics, Statistics and Computer Science (2018)
T. Nyathi, N. Pillay, Comparison of a genetic algorithm to grammatical evolution for automated design of genetic programming classification algorithms. Expert Syst. Appl. 104, 213–334 (2018)
J.H. Olson, R.S. anf Moore, Tpot: a tree-based pipeline optimiation tool for automating machine learning, in Automated Machine Learning-Methods, Systems, Challenges, ed. by F. Hutter, L. Kotthoff, J. Vanschoren (Springer, 2019)
M. O’Neill, C. Ryan, Grammatical Evolution-Evolutionary Automatic Programming in an Arbitrary Language (Kluwer Academic Publishers, 2003)
N. Pillay, R. Qu, Hyper-Heuristics: Theory and Applications (Springer, 2018)
N.R. Sabar, X. Yi, A. Song, A bi-objective hyper-heuristic support vector machines for big data cyber-security. IEEE Access 6, 10421–10431 (2018)
A. Vella, Hyper-Heuristic Decision Tree Induction. PhD thesis, School of Mathematical and Computer Sciences, Herriot-Watt University (2012)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Pillay, N., Nyathi, T. (2021). Automated Design of Classification Algorithms. In: Pillay, N., Qu, R. (eds) Automated Design of Machine Learning and Search Algorithms. Natural Computing Series. Springer, Cham. https://doi.org/10.1007/978-3-030-72069-8_10
Download citation
DOI: https://doi.org/10.1007/978-3-030-72069-8_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-72068-1
Online ISBN: 978-3-030-72069-8
eBook Packages: Computer ScienceComputer Science (R0)