Abstract
Presented paper deals with problem of large data series modeling by genetic programming algorithm. The need of repeated evaluation constraints size of training data set in standard Genetic Programming Algorithms (GPAs) because it causes unacceptable number of fitness function evaluations. Thus, the paper discusses possibility of floating data window use and brings results of tests on large training data vector containing 1 million rows. Used floating window is small and for each cycle of GPA it changes its position. This movement allows to incorporate information contained in large number of samples without the need to evaluate all data points contained in training data in each GPA cycle. Behaviors of this evaluation concept are demonstrated on symbolic regression of Lorenz attractor system equations from precomputed training data set calculated from original difference equations. As expected, presented results points that the algorithm is more efficient than evaluating of whole data set in each cycle of GPA.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge (1992)
Cartledge, C.H.: How Many VS Are There in Big Data? http://www.clc-ent.com/TBDE/Docs/vs.pdf. Accessed 8 June 2019
Verma, G., Verma, V.: Role and applications of genetic algorithm in data mining. Int. J. Comput. Appl. 48(17), 5–8 (2012)
Gandomi, A.H., Sajedi, S., Kiani, B., Huang, Q.: Genetic programming for experimental big data mining: a case study on concrete creep formulation. Autom. Constr. 70, 89–97 (2016). https://doi.org/10.1016/j.procs.2018.07.264
Poli, R., Langdon, W.B., McPhee, N.F., Koza R.J.: A field guide to genetic programming (2008). Published via http://lulu.com and freely available at http://www.gp-field-guide.org.uk. (With contributions by Koza R.J.)
Bader-EL-Den, M., Adda, M.: Automatic Programming for Optimization Problems with Big Data. https://www.findaphd.com/phds/project/automatic-programming-for-optimization-problems-with-big-data/?p62613. Accessed 12 Mar 2019
Hmida, H., Hamida, S.B., Borgi, A., Rukoz, M.: Scale genetic programming for large data sets: case of Higgs Bosons classification. Procedia Comput. Sci. 126, 302–311 (2018)
Kojecký, L., Zelinka, I., Šaloun, P.: Evolutionary synthesis of automatic classification on astroinformatic big data. Int. J. Parallel Emergent Distrib. Syst. 32(5), 429–447 (2017). https://doi.org/10.1080/17445760.2016.1194984
Andre, D., Koza, J.R.: Parallel genetic programming: a scalable implementation using the transputer network architecture. In: Angeline, P.J., Kinnear Jr., K.E. (eds.) Advances in Genetic Programming, vol. 2. The MIT Press, Cambridge (1996). (Chapter 16)
Juille, H., Pollack, J.B.: Parallel genetic programming and fine-grained SIMD architecture. In: Siegel, E.V., Koza, J.R. (eds.) Working Notes for the AAAI Symposium on Genetic Programming, pp. 31–37. MIT, Cambridge (1995)
Goldberg, D.E., Smith, R.E.: Nonstationary function optimization using genetic algorithms with dominance and diploidy. In: ICGA, pp. 59–68 (1987)
Vekaria, K., Clack, C.: Genetic programming with gene dominance. In: Koza, J.R. (ed.) Late Breaking Papers at the Genetic Programming 1997 Conference, vol. 300. Stanford University Bookstore, Stanford (1997)
Acknowledgement
The work was supported from ERDF/ESF “Co-operation in Applied Research between the University of Pardubice and companies, in the Field of Positioning, Detection and Simulation Technology for Transport Systems (PosiTrans)” (No. CZ.02.1.01/0.0/0.0/17_049/0008394).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Brandejsky, T. (2019). Floating Data Window Movement Influence to Genetic Programming Algorithm Efficiency. In: Silhavy, R., Silhavy, P., Prokopova, Z. (eds) Computational Statistics and Mathematical Modeling Methods in Intelligent Systems. CoMeSySo 2019 2019. Advances in Intelligent Systems and Computing, vol 1047. Springer, Cham. https://doi.org/10.1007/978-3-030-31362-3_4
Download citation
DOI: https://doi.org/10.1007/978-3-030-31362-3_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-31361-6
Online ISBN: 978-3-030-31362-3
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)