On the applicability of random and the best solution driven metaheuristics for analytic programming and time series regression

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper provides a closer insight into applicability and performance of the hybridization of symbolic regression open framework, which is Analytical Programming (AP) and Differential Evolution (DE) algorithm in the task of time series regression. AP can be considered as a robust open framework for symbolic regression thanks to its usability in any programming language with arbitrary driving metaheuristic. The motivation behind this research is to explore and investigate the applicability and differences in performance of AP driven by basic canonical entirely random or best solution driven mutation strategies of DE. An experiment with four case studies has been carried out here with the several time series consisting of GBP/USD exchange rate. The differences between regression/prediction models synthesized using AP as a direct consequence of different DE strategies performances are statistically compared and briefly discussed in conclusion section of this paper.

Cite

CITATION STYLE

APA

Senkerik, R., Viktorin, A., Pluhacek, M., Kadavy, T., & Oplatkova, Z. K. (2019). On the applicability of random and the best solution driven metaheuristics for analytic programming and time series regression. In Advances in Intelligent Systems and Computing (Vol. 764, pp. 489–498). Springer Verlag. https://doi.org/10.1007/978-3-319-91189-2_48

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