Abstract
This paper introduces a new approach to solving regression problems by using a particle swarm optimization algorithm to find optimal polynomial regressions to these problems. Polynomial regression is defined as a multi-objective optimization problem, with the goals to find both an optimal combination of terms in the polynomial and optimal values of the coefficients of the terms, in order to minimize the approximation error. This paper shows that a set-based PSO works well to find the optimal term structure of the target polynomials in low dimensions, and holds promise for improved performance in higher dimensions. The results of the set-based PSO are compared to the results of a Binary PSO on the same problems. Finally, this paper explores possible solutions to create a hybrid algorithm that can find both the optimal term structure and the coefficients of the found terms.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
van den Bergh, F., Engelbrecht, A.P.: A study of particle swarm optimization particle trajectories. Inf. Sci. 176(8), 937–971 (2006)
Engelbrecht, A.P., Grobler, J., Langeveld, J.: Set based particle swarm optimization for the feature selection problem. Eng. Appl. Artif. Intell. 85, 324–336 (2019)
Erwin, K., Engelbrecht, A.P.: Set-based particle swarm optimization for portfolio optimization. In: Proceedings of the Twelfth International Conference on Swarm Intelligence, pp. 333–339 (2020)
Hansen, N.: Adaptive encoding: how to render search coordinate system invariant. In: Proceedings of the International Conference on Parallel Problem Solving from Nature, pp. 205–214 (2008)
Hornik, K., Stinchcombe, M., White, H.: Multilayer feedforward networks are universal approximators. Neural Netw. 2(5), 359–366 (1989)
Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of the International Conference on Neural Networks, vol. 4, pp. 1942–1948 (1995)
Kennedy, J., Eberhart, R.C.: A discrete binary version of the particle swarm algorithm. In: Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation, vol. 5, pp. 4104–4108 (1997)
Krogh, A., Hertz, J.A.: A simple weight decay can improve generalization. In: Advances in Neural Information Processing Systems, vol. 4, pp. 950–957. Morgan-Kaufmann (1992)
Langeveld, J., Engelbrecht, A.P.: Set-based particle swarm optimization applied to the multidimensional knapsack problem. Swarm Intell. 6, 297–342 (2012)
Loshchilov, I., Schoenauer, M., Sebag, M.: Adaptive coordinate descent. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 885–892 (2011)
Oldewage, E.T.: The perils of particle swarm optimization in high dimensional problem spaces. In: MSc thesis, University of Pretoria (2019)
Pampara, G., Franken, N., Engelbrecht, A.P.: Combining particle swarm optimisation with angle modulation to solve binary problems. In: Proceedings of the IEEE Congress on Evolutionary Computation, vol. 1, pp. 89–96 (2005)
Shi, Y., Eberhart, R.: A modified particle swarm optimizer. In: Proceedings of the IEEE International Conference on Evolutionary Computation, pp. 69–73 (1998)
Sobol, I.M.: On the distribution of points in a cube and the approximate evaluation of integrals. USSR Comput. Math. Math. Phys. 7(4), 86–112 (1967)
Specht, D.F.: A general regression neural network. IEEE Trans. Neural Netw. 2(6), 568–576 (1991)
Acknowledgements
The authors acknowledge the Centre for High Performance Computing (CHPC), South Africa, for providing computational resources for this research paper.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
� 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
van Zyl, JP., Engelbrecht, A.P. (2021). Polynomial Approximation Using Set-Based Particle Swarm Optimization. In: Tan, Y., Shi, Y. (eds) Advances in Swarm Intelligence. ICSI 2021. Lecture Notes in Computer Science(), vol 12689. Springer, Cham. https://doi.org/10.1007/978-3-030-78743-1_19
Download citation
DOI: https://doi.org/10.1007/978-3-030-78743-1_19
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-78742-4
Online ISBN: 978-3-030-78743-1
eBook Packages: Computer ScienceComputer Science (R0)