Investigating the Applications of Machine Learning Techniques to Predict the Rock Brittleness Index
Deliang Sun, Mahshid Lonbani, Behnam Askarian and 4 more
Applied Sciences · 2020
doi:10.3390/app10051691 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
Despite the vast usage of machine learning techniques to solve engineering problems, a very limited number of studies on the rock brittleness index (<i>BI</i>) have used these techniques to analyze issues in this field. The present study developed five well-known machine learning techniques and compared their performance to predict the brittleness index of the rock samples. The comparison of the models’ performance was conducted through a ranking system. These techniques included Chi-square automatic interaction detector (CHAID), random forest (RF), support vector machine (SVM), K-nearest neighbors (KNN), and artificial neural network (ANN). This study used a dataset from a water transfer tunneling project in Malaysia. Results of simple rock index tests i.e., Schmidt hammer, p-wave velocity, point load, and density were considered as model inputs. The results of this study indicated that while the RF model had the best performance for training (ranking = 25), the ANN outperformed other models for testing (ranking = 22). However, the KNN model achieved the highest cumulative ranking, which was 37. The KNN model showed desirable stability for both training and testing. However, the results of validation stage indicated that RF model with coefficient of determination (<i>R<sup>2</sup></i>) of 0.971 provides higher performance capacity for prediction of the rock <i>BI</i> compared to KNN model with <i>R<sup>2</sup></i> of 0.807 and ANN model with <i>R<sup>2</sup></i> of 0.860. The results of this study suggest a practical use of the machine learning models in solving problems related to rock mechanics specially rock brittleness index.
Abstract licence: CC BY
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.