Using Machine Learning Algorithms to Estimate the Compressive Property of High Strength Fiber Reinforced Concrete

The low tensile strain capacity and brittle nature of high-strength concrete (HSC) can be improved by incorporating steel fibers into it. Steel fibers� addition in HSC results in bridging behavior which improves its post-cracking behavior, provides cracks arresting and stresses transfer in concrete. Using machine learning (ML) techniques, concrete properties prediction is an effective solution to conserve construction time and cost. Therefore, sophisticated ML approaches are applied in this study to predict the compressive strength of steel fiber reinforced HSC (SFRHSC). To fulfil this purpose, a standalone ML model called Multiple-Layer Perceptron Neural Network (MLPNN) and ensembled ML algorithms named Bagging and Adaptive Boosting (AdaBoost) were employed in this study. The considered parameters were cement content, fly ash content, slag content, silica fume content, nano-silica content, limestone powder content, sand content, coarse aggregate content, maximum aggregate size, water content, super-plasticizer content, steel fiber content, steel fiber diameter, steel fiber length, and curing time. The application of statistical checks, i.e., root mean square error (RMSE), determination coefficient (R2), and mean absolute error (MAE), was also performed for the assessment of algorithms� performance. The study demonstrated the suitability of the Bagging technique in the prediction of SFRHSC compressive strength. Compared to other models, the Bagging approach was more accurate as it produced higher, i.e., 0.94, R2, and lower error values. It was revealed from the SHAP analysis that curing time and super-plasticizer content have the most significant influence on the compressive strength of SFRHSC. The outcomes of this study will be beneficial for researchers in civil engineering for the timely and effective evaluation of SFRHSC compressive strength. © 2022 by the authors. Licensee MDPI, Basel, Switzerland.