2019
DOI: 10.1016/j.petrol.2018.11.067
|View full text |Cite
|
Sign up to set email alerts
|

The linear random forest algorithm and its advantages in machine learning assisted logging regression modeling

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

2
74
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 201 publications
(76 citation statements)
references
References 49 publications
2
74
0
Order By: Relevance
“…It is reasonable because RF has many advantages such as the following: (i) it can be effectively applied to largescale datasets as it provides the facility for size reduction without deleting unwanted variables from the training dataset; (ii) it can handle thousands of input features and variables at a time; (ii) it has an embedded efficient technique for estimating missing or null values. Hence, it is possible to maintain a level of accuracy (i.e., consistent performance) even when a large portion of the data is missing; (iv) it is able to perform a good parallel simulation because the number of trees generated and computed is completely independent of each other; and (v) this model can minimize errors as the results are synthesized from different "learners" (random forest trees) [46]. e results of this study are also comparable with other previous published works [46][47][48].…”
Section: Advances In Civil Engineeringmentioning
confidence: 99%
See 1 more Smart Citation
“…It is reasonable because RF has many advantages such as the following: (i) it can be effectively applied to largescale datasets as it provides the facility for size reduction without deleting unwanted variables from the training dataset; (ii) it can handle thousands of input features and variables at a time; (ii) it has an embedded efficient technique for estimating missing or null values. Hence, it is possible to maintain a level of accuracy (i.e., consistent performance) even when a large portion of the data is missing; (iv) it is able to perform a good parallel simulation because the number of trees generated and computed is completely independent of each other; and (v) this model can minimize errors as the results are synthesized from different "learners" (random forest trees) [46]. e results of this study are also comparable with other previous published works [46][47][48].…”
Section: Advances In Civil Engineeringmentioning
confidence: 99%
“…Hence, it is possible to maintain a level of accuracy (i.e., consistent performance) even when a large portion of the data is missing; (iv) it is able to perform a good parallel simulation because the number of trees generated and computed is completely independent of each other; and (v) this model can minimize errors as the results are synthesized from different "learners" (random forest trees) [46]. e results of this study are also comparable with other previous published works [46][47][48].…”
Section: Advances In Civil Engineeringmentioning
confidence: 99%
“…Breiman first made formal definition of the RF in 2001, which is a bagging of uncorrelated CART trees learned with randomized node optimization [70][71][72]. First, the algorithm generates N bootstrap samples for the training dataset.…”
Section: Random Forest and Agc Estimationmentioning
confidence: 99%
“…It uses ensemble learning techniques to train the model by constructing multiple decision trees (DTs). The main idea is to combine multiple DTs to determine the output for the trained model, which is more robust and efficient than relying on a single DT [19], [20].…”
Section: Introductionmentioning
confidence: 99%