Application of machine learning methods for automated selection of two-dimensional approximants
Abstract
Modern challenges in processing complex data require new approaches to modeling. One promising direction is the use of machine learning to automate the selection of approximants. This paper presents an approach to the automated selection of two-dimensional approximants using machine learning methods. The automation of approximant selection aims to improve the accuracy of modeling complex data, reduce computational costs, and provide flexibility of algorithms under various conditions. The proposed methods can be used for approximating nonlinear functions with a large number of data points, particularly in computer modeling and engineering analysis tasks. Practical results of algorithm applications are described, demonstrating that the proposed solutions significantly enhance computational efficiency.
References
Fornasier, M., Heid, P., & Sodini, G. E. (2023). Approximation Theory, Computing, and Deep Learning on the Wasserstein Space. arXiv preprint arXiv:2310.19548.
H. R. Abdul Ameer, A. S. Jaddoa, H. A. AL-Challabi and D. S. Abdul-Zahra, "Approximation Algorithm Applications in Artificial Intelligence: A Review," 2022 Fifth College of Science International Conference of Recent Trends in Information Technology (CSCTIT), Baghdad, Iraq, 2022, pp. 43-48, doi: 10.1109/CSCTIT56299.2022.10145686.
Rung-Ching Chen, Christine Dewi, Su-Wen Huang & Rezzy Eko Caraka (2020). Selecting critical features for data classification based on machine learning methods. SpringerOpen Journal of Big Data 10.1186/s40537-020-00327-4
Bishop, Christopher. (2006). Pattern Recognition and Machine Learning. doi:10.1117/1.2819119.
Dongwei Chen, Fei Hu, Guokui Nian and Tiantian Yang (2020). Deep Residual Learning for Nonlinear Regression. Mdpi 1099-4300/22/2/193
Ching-pei Lee & Kai-Wei Chang (2020). Distributed block-diagonal approximation methods for regularized empirical risk minimization. Springer Link 10.1007/s10994-019-05859-2

