IDEAS home Printed from https://ideas.repec.org/a/hin/complx/9978409.html
   My bibliography  Save this article

Random Forest versus Support Vector Machine Models’ Applicability for Predicting Beam Shear Strength

Author

Listed:
  • Hayder Riyadh Mohammed Mohammed
  • Sumarni Ismail
  • Haitham Afan

Abstract

The shear and bending are the actions that are experienced in the beam owing to the fact that the beam is a flexural member due to the load in the transverse direction to their longitudinal axis. The shear strength (Vs) computation of reinforced concrete (RC) beams has been a major topic in the field of structural engineering. There have been several methodologies introduced for the Vs prediction; however, the modeling accuracy is relatively low owing to the complex characteristic of the resistance mechanism involving dowel effect of longitudinal reinforcement, concrete in the compression zone, contribution of the stirrups if existed, and the aggregate interlock. Hence, the current research proposed a new soft computing model called random forest (RF) to predict Vs. Experimental datasets were collected from the open-source literature including the related geometric properties and concrete characteristics of beam specimens. Nine input combinations were constructed based on the statistical correlation to be supplied for the proposed predictive model. The prediction accuracy of the RF model was validated against the Support Vector Machine (SVM), and several other empirical formulations have been adopted in the literature. The proposed RF model revealed better prediction accuracy in addition the model structure emphasis in the incorporation of seven predictors by excluding (beam flange thickness and coefficient). In the quantitative term, the minimal root mean square error value was attained (RMSE = 89.68 kN).

Suggested Citation

  • Hayder Riyadh Mohammed Mohammed & Sumarni Ismail & Haitham Afan, 2021. "Random Forest versus Support Vector Machine Models’ Applicability for Predicting Beam Shear Strength," Complexity, Hindawi, vol. 2021, pages 1-17, June.
  • Handle: RePEc:hin:complx:9978409
    DOI: 10.1155/2021/9978409
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/complexity/2021/9978409.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/complexity/2021/9978409.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2021/9978409?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:complx:9978409. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.