Abstract
This paper discusses improvement of Genetic Programming Algorithm to large data sets with respect to future extension to big data applications. On the beginning it summarizes requirements on evolutionary system to be applicable in the area of big data and ways of their satisfaction. Then GPAs and especially their improvements by solution constant optimization (so called hierarchical and hybrid genetic programming algorithms) are discussed in this paper. After a discussion of few experiment results of introduced novel evaluation scheme approach with floating data window is presented. Novel evaluation scheme applies floating data window to fitness function evaluation. After one evaluation step of GPA including tuning of parameters (solution constants) by embedded Evolutionary Strategy algorithm data window moves to new position. Presented results demonstrate that this strategy can be faster and more efficient than evolution of whole training data set in each evolutionary step of GPA algorithm. This modification can be starting point of future applications of GPA in the field of large and big data analytic.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Laneym, D.: 3D Data Management: Controlling Data Volume, Velocity, and Variety. META Group Inc., file 949. https://blogs.gartner.com/doug-laney/files/2012/01/ad949-3D-Data-Management-Controlling-Data-Volume-Velocity-and-Variety.pdf. Assessed 19 Apr 2019
Poli, R., Langdon, W.B., McPhee, N.F., (with contributions by 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
Brandejsky, T.: Small populations in GPA-ES algorithm. In: Matousek, R. (ed.) MENDEL 2013, 19th International Conference on Soft Computing MENDEL 2013, Brno, 26–28 June 2013, pp. 31–36. Brno University of Technology, Faculty of Mechanical Engineering, Brno (2013). ISSN 1803-3814. ISBN 978-80-214-4755-4
Lorenz, E.N.: Deterministic nonperiodic flow. J. Atmos. Sci. 20, 130–141 (1963)
Rössler, O.E.: An equation for continuous chaos. Phys. Lett. 57A(5), 397–398 (1976). Bibcode: 1976PhLA…57..397R. https://doi.org/10.1016/0375-9601(76)90101-8
Miner, D., Shook, A.: MapReduce Design Patterns: Building Effective Algorithms and Analytics for Hadoop and Other Systems. O’Reilly Media, Inc. (2012). ISBN 1449341985
Abouzeid, A., Bajda-Pawlikowski, K., Abadi, D.J., Silberschatz, A., Rasin, A.: HadoopDB: an architectural hybrid of MapReduce and DBMS technologies for analytical workloads. In: VLDB, Lyon, France (2009)
Pavlo, A., Paulson, E., Rasin, A., Abadi, D.J., Dewitt, D.J., Madden, S., Stonebraker, M.: A comparison of approaches to large-scale data analysis. In: SIGMOD. ACM, June 2009
Yang, H.-C., Dasdan, A., Hsiao, R.-L., Parker, D.S.: Map-reduce-merge: simplified relational data processing on large clusters. In: SIGMOD (2007)
McKay, B., Willis, M.J., Barton, G.W.: Using a tree structured genetic algorithm to perform symbolic regression. In: Proceedings of the 1st International Conference on Genetic Algorithms in Engineering Systems: Innovations and Applications, UK, pp. 487–492 (1995)
Frohlich, J., Hafner, C.: Extended and generalized genetic programming for function analysis. J. Evol. Comput. (1996, submitted)
Raidl, G.R.: A hybrid GP approach for numerically robust symbolic regression. In: Koza, J.R., Banzhaf, W., Chhellapilla, K., Deb, K., Dorigo, M., Fogel, D.B., Garzon, M.H., Goldberg, D.E., Iba, H., Riolo, R. (eds.) Genetic Programming 1998: Proceedings of the Third Annual Conference, pp. 323–328. University of Wiconsin, Madison, Wisconsin, Morgan Kaufmann (1998)
Brandejsky, T.: Multi-layered evolutionary system suitable to symbolic model regression. In: Proceedings of the NAUN/IEEE.AM International Conferences, 2nd International Conference on Applied Informatics and Computing Theory, Praha, 26–28 September 2011, pp. 222–225. WSEAS Press, Athens (2011). ISBN 978-1-61804-038-1
Goldberg, D.E., Smith, R.E.: Nonstationary Function Optimization Using Genetic Algorithms with Dominance and Diploidy. ICGA (1987)
Acknowledgement
The work was supported from ERDF/ESF “Cooperation 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). GPA-ES Algorithm Modification for Large Data. In: Silhavy, R., Silhavy, P., Prokopova, Z. (eds) Intelligent Systems Applications in Software Engineering. CoMeSySo 2019 2019. Advances in Intelligent Systems and Computing, vol 1046. Springer, Cham. https://doi.org/10.1007/978-3-030-30329-7_9
Download citation
DOI: https://doi.org/10.1007/978-3-030-30329-7_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-30328-0
Online ISBN: 978-3-030-30329-7
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)