Performance Evaluation of Some Machine Learning Regression Models with Application

Authors

  • Asmaa Ali Zaidan Department of Mathematics, College of Science, University of Baghdad, Baghdad, Iraq
  • Tasnim Hasan Kadhim Department of Mathematics, College of Science, University of Baghdad, Baghdad, Iraq

DOI:

https://doi.org/10.24996/ijs.2025.66.9.28

Keywords:

Linear Model, Lasso Method, Convolutional Neural Network, Machine Learning

Abstract

      Currently, Machine learning is an advanced algorithm that yielding accurate classifications or predictions for huge samples sizes. The fat index data is asymmetric and has a right skew so this creates problem when using statistical techniques. For such data, there is still a lot of performance that needs to be improved when comparing statistical techniques and machine learning algorithms. This paper aimed to compare the traditional statistical methods represented by Linear, penalized linear such as Ridge and Lasso regression and machine learning models represented by convolutional neural network for their prediction performance through simulation experiments and real data of fat index. A total of 252 records were used. The prediction performance of fat index by Linear, Ridge, Lasso and Convolutional Network were compared using mean square error and mean absolute error. We concluded that Ridge and linear regression had the worst performance with the biggest mean and absolute prediction errors, while the Convolutional Neural Network technique achieved the lowest mean and absolute prediction errors, providing the best predictive performance for the fat index data and simulation experiments.

Downloads

Published

2025-09-30

Issue

Section

Mathematics

How to Cite

[1]
A. A. . Zaidan and T. H. . Kadhim, “Performance Evaluation of Some Machine Learning Regression Models with Application”, Iraqi Journal of Science, vol. 66, no. 9, pp. 3872–3886, Sep. 2025, doi: 10.24996/ijs.2025.66.9.28.

Similar Articles

1-10 of 2125

You may also start an advanced similarity search for this article.