Abstract
A discrete cosine transform (DCT) expresses a finite sequence of data points in terms of a sum of cosine functions oscillating at different frequencies, the energy-compaction property of which makes itself very suitable for symbolic regression problems with noisy data samples. In this paper, we propose a DCT based genetic programming (DCT-GP) for symbolic regression or other optimization problems with noisy experimental observations. Firstly, a sequence of experimental samples was changed from time domain into frequency domain with DCT. Secondly, the boundary between the low frequency components and high frequency components was decided, by which most of the noise inserted into the sample data can be discarded. The experimental sample sequence was rebuilt with the low frequency components. Finally, the new obtained samples were looked on as another fitness function and were used to direct the evolutionary procedure of GP. In this way, DCT was integrated into the GP algorithm. The major advantage of the DCT-GP algorithm is that, on the one hand, it can deal with the regression problem with noisy data samples and obtain accurate solutions. On the other hand, if the sample scale is very small, it can deal with the over-fitting problem in the regression progress and can avoid losing of structure information when the available samples were departed into training set and validating set. The performance of the proposed DCT-GP algorithm with several regression problems indicates that the proposed algorithm can find the solution more efficiently and effectively than traditional sample-partitioning based GP algorithms.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Sen, A., Srivastava, M.: Regression Analysis − Theory, Methods, and Applications. Springer-Verlag, Berlin (2011, 4th printing)
Armstrong, J.S.: Illusions in regression analysis. Int. J. Forecast. (forthcoming) 28(3), 689 (2012). https://doi.org/10.1016/j.ijforecast.2012.02.001
Carroll, R.J.: Transformation and weighting in regression. Routledge (2017)
Sacks, J., Welch, W.J., Mitchell, T.J., Wynn, H.P.: Design and analysis of computer experiments. Statist. Sci. 4, 409–435 (1989)
Haykin, S.: Neural Networks: A Comprehensive Foundation. Prentice Hall PTR (1994)
Vapnik, V.N.: The support vector method. In: International Conference on Artificial Neural Networks, pp. 261–271. Springer, Berlin, Heidelberg (1997)
Breiman, L.: Classification and Regression Trees. Routledge (2017)
Cano, A., Ventura, S., Cios, K.J.: Multi-objective genetic programming for feature extraction and data visualization. Soft. Comput. 21(8), 2069–2089 (2017)
Bannister, C.A., Halcox, J.P., Currie, C.J., et al.: A genetic programming approach to development of clinical prediction models: a case study in symptomatic cardiovascular disease. PLoS One 13(9), e0202685 (2018)
Tsakonas, A., Dounias, G., Doumpos, M., Zopounidis, C.: Bankruptcy prediction with neural logic networks by means of grammar-guided genetic programming. Expert Syst. Appl. 30, 449–461 (2006)
Hoai, N.X., McKay, R.I., Essam, D., et al.: Solving the symbolic regression problem with tree-adjunct grammar guided genetic programming: The comparative results. In: Proceedings of the 2002 Congress on Evolutionary Computation, CEC 2002, vol. 2, pp. 1326–1331. IEEE (2002)
Ferreira, C.: Gene expression programming: a new adaptive algorithm for solving problems. Complex Syst. 13(2), 87–129 (2001)
Ferreira, C.: Gene Expression Programming: Mathematical Modeling by an Artificial Intelligence. Springer (2006)
Peng, Y.Z., Yuan, C.A., Qin, X., et al.: An improved gene expression programming approach for symbolic regression problems. Neurocomputing 137, 293–301 (2014)
Jin, Y., Olhofer, M., Sendhoff, B.: On evolutionary optimization with approximate fitness functions. In: Proceedings of the 2nd Annual Conference on Genetic and Evolutionary Computation. Morgan Kaufmann Publishers Inc., 786–793 (2000)
Vladislavleva, E.Y.: Model-based problem solving through symbolic regression via pareto genetic programming. CentER, Tilburg University (2008)
Vladislavleva, E.J., Smits, G.F., Den Hertog, D.: Order of nonlinearity as a complexity measure for models generated by symbolic regression via pareto genetic programming. IEEE Trans. Evol. Comput. 13(2), 333–349 (2009)
Silva, S.G.O.: Controlling bloat: individual and population based approaches in genetic programming. (2008)
Zavoianu, A.C.: Towards solution parsimony in an enhanced genetic programming process. Master’s thesis, International School Informatics: Engineering & Management, ISI-Hagenberg, Johannes Kepler University, Linz (2010)
Vanneschi, L., Castelli, M., Silva, S.: Measuring bloat, overfitting and functional complexity in genetic programming. In: Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation, pp. 877–884. ACM (2010)
Mousavi Astarabadi, S.S., Ebadzadeh, M.M.: Avoiding overfitting in symbolic regression using the first order derivative of GP trees. In: Proceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary Computation, pp. 1441–1442. ACM (2015)
Chen, Q., Xue, B., Niu, B., et al.: Improving generalisation of genetic programming for high-dimensional symbolic regression with feature selection. In: 2016 IEEE Congress on Evolutionary Computation (CEC), pp. 3793–3800. IEEE (2016)
Zhao, Li, Wang, Lei: Hoeffding bound based evolutionary algorithm for symbolic regression. Eng. Appl. Artif. Intell. 25, 945–957 (2012)
Gagné, C., Schoenauer, M., Parizeau, M., et al.: Genetic programming, validation sets, and parsimony pressure. In: European Conference on Genetic Programming, pp. 109–120. Springer, Berlin, Heidelberg (2006)
Liu, Y., Khoshgoftaar, T.: Reducing overfitting in genetic programming models for software quality classification. In: Eighth IEEE International Conference on High Assurance Systems Engineering, pp. 56–65. IEEE Computer Society (2004)
Foreman, N., Evett, M.: Preventing overfitting in GP with canary functions. In: Proceedings of the 7th Annual Conference on Genetic and Evolutionary Computation, pp. 1779–1780. ACM (2005)
Gonçalves, I., Silva, S.: Experiments on controlling overfitting in genetic programming. In: 15th Portuguese Conference on Artificial Intelligence (EPIA 2011), pp. 10–13 (2011)
Trujillo, L., Silva, S., Legrand, P., et al.: An empirical study of functional complexity as an indicator of overfitting in genetic programming. In: European Conference on Genetic Programming, pp. 262–273. Springer, Heidelberg (2011)
Austel, V., Dash, S., Gunluk, O., et al.: Globally Optimal Symbolic Regression (2017)
Ahmed, N., Natarajan, T., Rao, K.R.: Discrete cosine transform. IEEE Trans. Comput. 90–93 (1974)
Cramer, N.L.: A representation for the adaptive generation of simple sequential programs. Proceedings of the First International Conference on Genetic Algorithms, pp. 183–187 (1985)
Zameer, A., Arshad, J., Khan, A., et al.: Intelligent and robust prediction of short term wind power using genetic programming based ensemble of neural networks. Energy Convers. Manag. 134, 361–372 (2017)
EnrÃquez-Zárate, J., Trujillo, L., de Lara, S., et al.: Automatic modeling of a gas turbine using genetic programming: an experimental study. Appl. Soft Comput. 50, 212–222 (2017)
Pimenta, A., Nametala, C.A.L., Guimarães, F.G., et al.: An automated investing method for stock market based on multiobjective genetic programming. Comput. Econ. 52(1), 125–144 (2018)
Silva, S., Costa, E.: Dynamic limits for bloat control in genetic programming and a review of past and current bloat theories. Genet. Program. Evolvable Mach. 10(2), 141–179 (2009)
Keijzer, M.: Improving symbolic regression with interval arithmetic and linear scaling. In: European Conference on Genetic Programming, pp. 70–82. Springer, Heidelberg (2003)
Kotanchek, M., Smits, G., Vladislavleva, E.: Trustable symbolic regression models: using ensembles, interval arithmetic and pareto fronts to develop robust and trust-aware models. Genetic programming theory and practice V, pp. 201–220. Springer, US (2008)
Stinstra, E., Rennen, G., Teeuwen, G.: Metamodeling by symbolic regression and Pareto simulated annealing. Struct. Multidisc. Optim. 35(4), 315–326 (2008)
Ngatchou, P., Zarei, A., El-Sharkawi, A.: Pareto multi objective optimization. In: Proceedings of the 13th International Conference on Intelligent Systems, pp. 84–91. IEEE (2005)
Acknowledgements
We are grateful to the anonymous referees for their invaluable suggestions to improve the paper. This work is financially supported by The National Key Research and Development Program of China (No. 2018YFC0704304).
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
Liu, Q., Hu, Y. (2019). A Discrete Cosine Transform Based Evolutionary Algorithm and Its Application for Symbolic Regression. In: Arai, K., Bhatia, R., Kapoor, S. (eds) Intelligent Computing. CompCom 2019. Advances in Intelligent Systems and Computing, vol 997. Springer, Cham. https://doi.org/10.1007/978-3-030-22871-2_30
Download citation
DOI: https://doi.org/10.1007/978-3-030-22871-2_30
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-22870-5
Online ISBN: 978-3-030-22871-2
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)