<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article article-type="research-article" dtd-version="2.3" xml:lang="EN" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Front. Earth Sci.</journal-id>
<journal-title>Frontiers in Earth Science</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Earth Sci.</abbrev-journal-title>
<issn pub-type="epub">2296-6463</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">888933</article-id>
<article-id pub-id-type="doi">10.3389/feart.2022.888933</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Earth Science</subject>
<subj-group>
<subject>Original Research</subject>
</subj-group>
</subj-group>
</article-categories>
<title-group>
<article-title>Reservoir Parameter Prediction Based on the Neural Random Forest Model</article-title>
<alt-title alt-title-type="left-running-head">Wang et al.</alt-title>
<alt-title alt-title-type="right-running-head">Neural RF Interpretes Well Logs</alt-title>
</title-group>
<contrib-group>
<contrib contrib-type="author" corresp="yes">
<name>
<surname>Wang</surname>
<given-names>Mingchuan</given-names>
</name>
<xref ref-type="corresp" rid="c001">&#x2a;</xref>
<uri xlink:href="https://loop.frontiersin.org/people/1333154/overview"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Feng</surname>
<given-names>Dongjun</given-names>
</name>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Li</surname>
<given-names>Donghui</given-names>
</name>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Wang</surname>
<given-names>Jiwei</given-names>
</name>
</contrib>
</contrib-group>
<aff>
<institution>SINOPEC Petroleum Exploration and Production Research Institute</institution>, <addr-line>Beijing</addr-line>, <country>China</country>
</aff>
<author-notes>
<fn fn-type="edited-by">
<p>
<bold>Edited by:</bold> <ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/1356194/overview">Kai Zhang</ext-link>, China University of Petroleum, China</p>
</fn>
<fn fn-type="edited-by">
<p>
<bold>Reviewed by:</bold> <ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/1715328/overview">Olabode Ijasan</ext-link>, ExxonMobil, United States</p>
<p>
<ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/1718091/overview">Leila Aliouane</ext-link>, University of Boumerd&#xe9;s, Algeria</p>
</fn>
<corresp id="c001">&#x2a;Correspondence: Mingchuan Wang, <email>wangmc.syky@sinopec.com</email>
</corresp>
<fn fn-type="other">
<p>This article was submitted to Environmental Informatics and Remote Sensing, a section of the journal Frontiers in Earth Science</p>
</fn>
</author-notes>
<pub-date pub-type="epub">
<day>13</day>
<month>05</month>
<year>2022</year>
</pub-date>
<pub-date pub-type="collection">
<year>2022</year>
</pub-date>
<volume>10</volume>
<elocation-id>888933</elocation-id>
<history>
<date date-type="received">
<day>03</day>
<month>03</month>
<year>2022</year>
</date>
<date date-type="accepted">
<day>11</day>
<month>04</month>
<year>2022</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#xa9; 2022 Wang, Feng, Li and Wang.</copyright-statement>
<copyright-year>2022</copyright-year>
<copyright-holder>Wang, Feng, Li and Wang</copyright-holder>
<license xlink:href="http://creativecommons.org/licenses/by/4.0/">
<p>This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.</p>
</license>
</permissions>
<abstract>
<p>Porosity and saturation are the basis for describing reservoir properties and formation characteristics. The traditional, empirical, and formulaic methods are unable to accurately capture the nonlinear mapping relationship between log data and reservoir physical parameters. To solve this problem, in this study, a novel hybrid model (NRF) combining neural network (NN) and random forest (RF) was proposed based on well logging data to predict the porosity and saturation of shale gas reservoirs. The database includes six horizontal wells, and the input logs include borehole diameter, neutron, density, gamma-ray, and acoustic and deep investigate double lateral resistivity log. The porosity and saturation were chosen as outputs. The NRF model with independent and joint training was designed to extract key features from well log data and physical parameters. It provides a promising method for forecasting the porosity and saturation with R<sup>2</sup> above 0.94 and 0.82 separately. Compared with baseline models (NN and RF), the NRF model with joint training obtains the unsurpassed performance to predict porosity with R<sup>2</sup> above 0.95, which is 1.1% higher than that of the NRF model with independent training, 3.9% higher than RF, and superiorly greater than NN. For the prediction of saturation, the NRF model with joint training is still superior to other algorithms, with R<sup>2</sup> above 0.84, which is 2.1% higher than that of the NRF model with independent training and 7.0% higher than RF. Furthermore, the NRF model has a similar data distribution with measured porosity and saturation, which demonstrates the NRF model can achieve greater stability. It was proven that the proposed NRF model can capture the complex relationship between the logging data and physical parameters more accurately, and can serve as an economical and reliable alternative tool to give a reliable prediction.</p>
</abstract>
<kwd-group>
<kwd>logging interpretation</kwd>
<kwd>machine learning</kwd>
<kwd>reservoir parameter estimation</kwd>
<kwd>neural random forest</kwd>
<kwd>well logs</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1">
<title>1 Introduction</title>
<p>Logging curves can reflect different lithology and formation characteristics. In recent years, the prediction of reservoir parameters using log curve data has become a focus of research.</p>
<p>Reservoir physical parameters, which mainly include porosity, permeability, water saturation, and oil saturation, are the basis for describing reservoir properties and reservoir modeling (<xref ref-type="bibr" rid="B17">Li et al., 2016</xref>; <xref ref-type="bibr" rid="B29">Wang et al., 2019</xref>; <xref ref-type="bibr" rid="B26">Song et al., 2021a</xref>). Specifically, the pore space of a reservoir is an important space for the accumulation and transport of hydrocarbons. It is also a fundamental requirement for the formation of hydrocarbon reservoirs. The size of porosity directly reflects the ability of the rock to store hydrocarbons. It is an important part of reservoir evaluation and occupies a very important position in the exploration and development of oil and gas fields. The oil, gas, and water saturation in a reservoir is also a fundamental parameter for estimating oil reserves and judging the characteristics of the reservoir.</p>
<p>At present, there are two major approaches used for the measurement of porosity and saturation (<xref ref-type="bibr" rid="B25">Song et al., 2020</xref>; <xref ref-type="bibr" rid="B30">Wang et al., 2020</xref>; <xref ref-type="bibr" rid="B27">Song et al., 2021b</xref>). The first method is a direct estimation, namely, obtaining the actual physical parameter data using rock slices or cores. This method is often performed in the laboratory and is more accurate, but it is time-consuming and costly. The second method is the indirect measurement, namely, estimating the porosity and saturation based on the geological and statistical methods as well as function approximation (<xref ref-type="bibr" rid="B32">Wyllie et al., 1956</xref>; <xref ref-type="bibr" rid="B20">Raymer et al., 1980</xref>). Early logging methods for predicting reservoir parameters are mainly aimed at linear data. The physical parameters are calculated using linear equations and empirical formulas, which is a purely mathematical method without considering the actual reservoirs&#x2019; environment.</p>
<p>However, some reservoirs are highly heterogeneous, and the geological environment is complex. In addition, the relationship between the logging data and reservoir parameters is nonlinear. The traditional regression analysis methods are difficult to achieve satisfactory results. Therefore, exploring a novel method for reservoir parameter prediction is particularly necessary for the development of unconventional and complex oil and gas fields.</p>
<p>With the rise of the emergence of big data and artificial intelligence, machine learning has been rapidly developed and applied. Some researchers have obtained the reservoir parameters such as permeability, porosity, and saturation. <xref ref-type="bibr" rid="B2">Akande et al. (2015</xref>) proposed an artificial neural network (ANN) based on the correlation feature selection to predict permeability. The results show that this method can predict permeability with fewer features. <xref ref-type="bibr" rid="B15">Komarialaei and Salahshoor (2012</xref>) also used the ANN model with the principal component analysis (PCA) to predict permeability. The experimental results show that the method has certain practicality. <xref ref-type="bibr" rid="B12">Hadi and Sadegh (2016</xref>) predicted the porosity using an intelligent method based on seismic attribute data. J. <xref ref-type="bibr" rid="B24">Song et al. (2016</xref>) introduced the random forest method to predict seismic reservoirs, and it is found that the method is less affected by noisy data and has certain stability and accuracy.</p>
<p>Predicting the porosity and saturation based on well logs using machine learning algorithms is a feasible and alternative method. However, the accuracy cannot fully meet the requirement. Therefore, the complex nonlinear relationship is still needed to be further explored.</p>
</sec>
<sec id="s2">
<title>2 Methodology</title>
<p>In this section, the methodologies of the neural random forest algorithm are introduced systematically. As the basis of the neural random forests, the principle of neural network and random forests are presented at the first, and the ensemble of neural network and random forests is introduced later. Finally, the evaluation criteria of the machine learning model are presented.</p>
<sec id="s2-1">
<title>2.1 Model Establishing</title>
<sec id="s2-1-1">
<title>2.1.1 Neural Network</title>
<p>The neural network (NN) is a robust and effective computational tool for establishing nonlinear patterns between the complex nonlinear data. In particular, supervised learning is adopted for most applications (<xref ref-type="bibr" rid="B21">Rolon et al., 2009</xref>; <xref ref-type="bibr" rid="B14">Khandelwal and Singh, 2010</xref>; <xref ref-type="bibr" rid="B22">Saputro et al., 2016</xref>). The typical NN contains an input layer, an output layer, and more than one hidden layer (<xref ref-type="bibr" rid="B11">Gardner and Dorling, 1998</xref>; <xref ref-type="bibr" rid="B3">Basheer and Hajmeer, 2000</xref>; <xref ref-type="bibr" rid="B23">Schmidhuber, 2015</xref>; <xref ref-type="bibr" rid="B19">Prieto et al., 2016</xref>).</p>
<p>In the training process, the weight and threshold between each neuron of the neural network are adjusted continuously.</p>
<p>Suppose the training data are <inline-formula id="inf1">
<mml:math id="m1">
<mml:mrow>
<mml:mi>D</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mo>{</mml:mo>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msup>
<mml:mi>x</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msup>
<mml:mo>,</mml:mo>
<mml:msup>
<mml:mi>y</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msup>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>,</mml:mo>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msup>
<mml:mi>x</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mn>2</mml:mn>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msup>
<mml:mo>,</mml:mo>
<mml:msup>
<mml:mi>y</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mn>2</mml:mn>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msup>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>,</mml:mo>
<mml:mo>&#x22ef;</mml:mo>
<mml:mo>,</mml:mo>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msup>
<mml:mi>x</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>r</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msup>
<mml:mo>,</mml:mo>
<mml:msup>
<mml:mi>y</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>r</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msup>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>,</mml:mo>
<mml:mo>&#x22ef;</mml:mo>
<mml:mo>,</mml:mo>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msup>
<mml:mi>x</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>m</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msup>
<mml:mo>,</mml:mo>
<mml:msup>
<mml:mi>y</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>m</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msup>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mo>}</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula id="inf2">
<mml:math id="m2">
<mml:mrow>
<mml:msup>
<mml:mi>w</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula> is the weight matrix from the <inline-formula id="inf3">
<mml:math id="m3">
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula> layer to <inline-formula id="inf4">
<mml:math id="m4">
<mml:mi>l</mml:mi>
</mml:math>
</inline-formula>, <inline-formula id="inf5">
<mml:math id="m5">
<mml:mrow>
<mml:msubsup>
<mml:mi>w</mml:mi>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mi>k</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> is the weight from the k-th neuron in the <inline-formula id="inf6">
<mml:math id="m6">
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula> layer to the j-th neuron in the <inline-formula id="inf7">
<mml:math id="m7">
<mml:mi>l</mml:mi>
</mml:math>
</inline-formula> layer. <inline-formula id="inf8">
<mml:math id="m8">
<mml:mrow>
<mml:msubsup>
<mml:mi>b</mml:mi>
<mml:mi>j</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> is the bias of the j-th neuron in the <inline-formula id="inf9">
<mml:math id="m9">
<mml:mi>l</mml:mi>
</mml:math>
</inline-formula> layer. <inline-formula id="inf10">
<mml:math id="m10">
<mml:mrow>
<mml:msubsup>
<mml:mi>z</mml:mi>
<mml:mi>j</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> is the input of the j-th neuron in the <inline-formula id="inf11">
<mml:math id="m11">
<mml:mi>l</mml:mi>
</mml:math>
</inline-formula> layer. Then the input of each neuron in each layer is expressed as <xref ref-type="disp-formula" rid="e1">Eq. 1</xref>.<disp-formula id="e1">
<mml:math id="m12">
<mml:mrow>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:mrow>
<mml:mtable>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msubsup>
<mml:mi>z</mml:mi>
<mml:mn>1</mml:mn>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msubsup>
<mml:mi>z</mml:mi>
<mml:mn>2</mml:mn>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mo>&#x22ee;</mml:mo>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msubsup>
<mml:mi>z</mml:mi>
<mml:mrow>
<mml:msup>
<mml:mi>N</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msup>
</mml:mrow>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
<mml:mo>]</mml:mo>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:mrow>
<mml:mtable>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msubsup>
<mml:mi>w</mml:mi>
<mml:mrow>
<mml:mn>11</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:mtd>
<mml:mtd>
<mml:mrow>
<mml:msubsup>
<mml:mi>w</mml:mi>
<mml:mrow>
<mml:mn>12</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:mtd>
<mml:mtd>
<mml:mo>&#x22ef;</mml:mo>
</mml:mtd>
<mml:mtd>
<mml:mrow>
<mml:msubsup>
<mml:mi>w</mml:mi>
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:msup>
<mml:mi>N</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msup>
</mml:mrow>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msubsup>
<mml:mi>w</mml:mi>
<mml:mrow>
<mml:mn>21</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:mtd>
<mml:mtd>
<mml:mrow>
<mml:msubsup>
<mml:mi>w</mml:mi>
<mml:mrow>
<mml:mn>22</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:mtd>
<mml:mtd>
<mml:mo>&#x22ef;</mml:mo>
</mml:mtd>
<mml:mtd>
<mml:mrow>
<mml:msubsup>
<mml:mi>w</mml:mi>
<mml:mrow>
<mml:mn>2</mml:mn>
<mml:msup>
<mml:mi>N</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msup>
</mml:mrow>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mo>&#x22ee;</mml:mo>
</mml:mtd>
<mml:mtd>
<mml:mo>&#x22ee;</mml:mo>
</mml:mtd>
<mml:mtd>
</mml:mtd>
<mml:mtd>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msubsup>
<mml:mi>w</mml:mi>
<mml:mrow>
<mml:msup>
<mml:mi>N</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msup>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:mtd>
<mml:mtd>
<mml:mrow>
<mml:msubsup>
<mml:mi>w</mml:mi>
<mml:mrow>
<mml:msup>
<mml:mi>N</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msup>
<mml:mn>2</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:mtd>
<mml:mtd>
<mml:mo>&#x22ef;</mml:mo>
</mml:mtd>
<mml:mtd>
<mml:mrow>
<mml:msubsup>
<mml:mi>w</mml:mi>
<mml:mrow>
<mml:msup>
<mml:mi>N</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msup>
<mml:msup>
<mml:mi>N</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msup>
</mml:mrow>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
<mml:mo>]</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:mrow>
<mml:mtable>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msubsup>
<mml:mi>a</mml:mi>
<mml:mn>1</mml:mn>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msubsup>
<mml:mi>a</mml:mi>
<mml:mn>2</mml:mn>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mo>&#x22ee;</mml:mo>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msubsup>
<mml:mi>a</mml:mi>
<mml:mrow>
<mml:msup>
<mml:mi>N</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msup>
</mml:mrow>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
<mml:mo>]</mml:mo>
</mml:mrow>
<mml:mo>&#x2b;</mml:mo>
<mml:mrow>
<mml:mo>[</mml:mo>
<mml:mrow>
<mml:mtable>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msubsup>
<mml:mi>b</mml:mi>
<mml:mn>1</mml:mn>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msubsup>
<mml:mi>b</mml:mi>
<mml:mn>2</mml:mn>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mo>&#x22ee;</mml:mo>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msubsup>
<mml:mi>b</mml:mi>
<mml:mrow>
<mml:msup>
<mml:mi>N</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msup>
</mml:mrow>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
<mml:mo>]</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(1)</label>
</disp-formula>
</p>
<p>Namely,<disp-formula id="e2">
<mml:math id="m13">
<mml:mrow>
<mml:msup>
<mml:mi>z</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msup>
<mml:mo>&#x3d;</mml:mo>
<mml:msup>
<mml:mi>w</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msup>
<mml:msup>
<mml:mi>a</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msup>
<mml:mo>&#x2b;</mml:mo>
<mml:msup>
<mml:mi>b</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msup>
<mml:mo>.</mml:mo>
</mml:mrow>
</mml:math>
<label>(2)</label>
</disp-formula>
</p>
<p>Among them, <inline-formula id="inf12">
<mml:math id="m14">
<mml:mrow>
<mml:msup>
<mml:mi>a</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msup>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>&#x3c3;</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msup>
<mml:mi>z</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msup>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>, where <inline-formula id="inf13">
<mml:math id="m15">
<mml:mrow>
<mml:mi>&#x3c3;</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>x</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> is the activation function. Then,<disp-formula id="e3">
<mml:math id="m16">
<mml:mrow>
<mml:msup>
<mml:mi>a</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msup>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>&#x3c3;</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msup>
<mml:mi>w</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msup>
<mml:msup>
<mml:mi>a</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msup>
<mml:mo>&#x2b;</mml:mo>
<mml:msup>
<mml:mi>b</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msup>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>.</mml:mo>
</mml:mrow>
</mml:math>
<label>(3)</label>
</disp-formula>
</p>
<p>Finally, in the forward propagation, the output of the neural network is expressed as<disp-formula id="e4">
<mml:math id="m17">
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>x</mml:mi>
<mml:mo>;</mml:mo>
<mml:mi>&#x3b8;</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>&#x3c3;</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msup>
<mml:mi>w</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>L</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msup>
<mml:mo>&#x22ef;</mml:mo>
<mml:mi>&#x3c3;</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msup>
<mml:mi>w</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mn>2</mml:mn>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msup>
<mml:mi>&#x3c3;</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msup>
<mml:mi>w</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msup>
<mml:mi>x</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:msup>
<mml:mi>b</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msup>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x2b;</mml:mo>
<mml:msup>
<mml:mi>b</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mn>2</mml:mn>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msup>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x22ef;</mml:mo>
<mml:mo>&#x2b;</mml:mo>
<mml:msup>
<mml:mi>b</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>L</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msup>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>,</mml:mo>
</mml:mrow>
</mml:math>
<label>(4)</label>
</disp-formula>where L represents the output layer of the neural network, and<disp-formula id="e5">
<mml:math id="m18">
<mml:mrow>
<mml:mi>&#x3b8;</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mo>{</mml:mo>
<mml:mrow>
<mml:msup>
<mml:mi>w</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msup>
<mml:mo>,</mml:mo>
<mml:msup>
<mml:mi>b</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msup>
<mml:mo>,</mml:mo>
<mml:msup>
<mml:mi>w</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mn>2</mml:mn>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msup>
<mml:mo>,</mml:mo>
<mml:msup>
<mml:mi>b</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mn>2</mml:mn>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msup>
<mml:mo>,</mml:mo>
<mml:mo>&#x22ef;</mml:mo>
<mml:mo>,</mml:mo>
<mml:msup>
<mml:mi>w</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>L</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msup>
<mml:mo>,</mml:mo>
<mml:msup>
<mml:mi>b</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>L</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msup>
</mml:mrow>
<mml:mo>}</mml:mo>
</mml:mrow>
<mml:mo>.</mml:mo>
</mml:mrow>
</mml:math>
<label>(5)</label>
</disp-formula>
</p>
<p>The loss function <inline-formula id="inf14">
<mml:math id="m19">
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>&#x3b8;</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> is defined as<disp-formula id="e6">
<mml:math id="m20">
<mml:mrow>
<mml:msup>
<mml:mi>C</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msup>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>&#x3b8;</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mi>m</mml:mi>
</mml:mfrac>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>r</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>m</mml:mi>
</mml:munderover>
<mml:mrow>
<mml:mrow>
<mml:mo>&#x2016;</mml:mo>
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msup>
<mml:mi>x</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>r</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msup>
<mml:mo>;</mml:mo>
<mml:mi>&#x3b8;</mml:mi>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:msup>
<mml:mi>y</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>r</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msup>
</mml:mrow>
<mml:mo>&#x2016;</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:mstyle>
<mml:mo>,</mml:mo>
</mml:mrow>
</mml:math>
<label>(6)</label>
</disp-formula>
<disp-formula id="e7">
<mml:math id="m21">
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>&#x3b8;</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mrow>
<mml:msup>
<mml:mi>N</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>L</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:mfrac>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>r</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:msup>
<mml:mi>N</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>L</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:munderover>
<mml:mrow>
<mml:msup>
<mml:mi>C</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>i</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:msup>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>&#x3b8;</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:mstyle>
<mml:mo>.</mml:mo>
</mml:mrow>
</mml:math>
<label>(7)</label>
</disp-formula>
</p>
<p>In addition, in this article, we adopt the particle swarm optimization (PSO) to optimize the weight and bias. The PSO is performed to solve the global optimization problems by simulating the biological population (<xref ref-type="bibr" rid="B13">Kennedy and Eberhart, 1995</xref>; <xref ref-type="bibr" rid="B9">Eberhart and Shi, 2001</xref>). It has received extensive attention because of its few parameters and easy implementation.</p>
<p>It is noticed that the interpretability of the machine learning model is necessary to assist to make decisions. Although the neural network can obtain nonlinear relationships among data, it is uneasy to clarify how it works, which is called the &#x201c;black box.&#x201d; In addition, the neural network has plenty of hyperparameters to tune, which is time-consuming.</p>
</sec>
<sec id="s2-1-2">
<title>2.1.2 Random Forest Algorithm</title>
<p>Random forest (RF) is an ensemble machine learning approach proposed by <xref ref-type="bibr" rid="B6">Breiman (2001</xref>), which has the advantages of interpretability, convenience, and fast calculating speed. RF is independently built by several decision trees. Decision trees are the basic classifier in the RF algorithm. Compared with the neural networks, the decision trees are interpretable. It starts from the root node and constructs the tree nodes one by one based on the rule for prediction or classification.</p>
<p>The standard RF is built upon the bootstrap datasets and splitting with the classification and regression tree (CART) (<xref ref-type="bibr" rid="B5">Breiman et al., 1984</xref>) methodology. This method works on the bagging principle. Bagging algorithms randomly select samples from the raw data so that the training of each basic classifier in the ensemble is independent of the others. Specifically, the flow of the construction of RF is as follows:</p>
<p>First, at each node of the decision tree, the predictor variables are sampled randomly. Then, the algorithm finds the minimal residual sum of squares (RSS) for regression or categorization. Furthermore, data are divided into the &#x201c;in-bag&#x201d; subset for training and the &#x201c;out-of-bag (OOB)&#x201d; subset for validation. Finally, the decision trees are combined through the majority (categorization) or the average (regression) vote to form the final prediction result (<xref ref-type="bibr" rid="B7">Despoina et al., 2021</xref>).</p>
<p>Compared with the neural network, RF has fewer parameters to tune. However, on some classification or regression problems, it is prone to overfit with the noisy data.</p>
</sec>
<sec id="s2-1-3">
<title>2.1.3 Proposed Neural Random Forests</title>
<p>With respect to the shortcomings of both the neural network framework and random forests, <xref ref-type="bibr" rid="B31">Welbl (2014</xref>) and <xref ref-type="bibr" rid="B8">Richmond et al. (2015</xref>) had demonstrated the importance of casting the RF algorithm into a neural network framework. To exploit the benefits of both algorithms, <xref ref-type="bibr" rid="B4">Biau et al. (2019</xref>) proposed two new hybrid procedures to reformulate the RF method into a neural network which is called neural random forests (NRF). The NRF method exploits prior knowledge of regression trees and provides interpretability. In addition, this method has more excellent performance than the RF method and neural networks.</p>
<p>NRF has two different ways to combine the individual networks: one is the independent training and the other is the joint training.</p>
<p>Assume a random forest is a predictor consisting of a collection of M (large) regression trees: the training sample is <inline-formula id="inf15">
<mml:math id="m22">
<mml:mrow>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mi>n</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>X</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>Y</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:mo>,</mml:mo>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>X</mml:mi>
<mml:mi>n</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>Y</mml:mi>
<mml:mi>n</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>,</mml:mo>
<mml:mi>n</mml:mi>
<mml:mo>&#x2265;</mml:mo>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:math>
</inline-formula>, where X is the feature data and Y is the corresponding label.</p>
<p>For independent training, the parameters of each tree-type network are fitted network by network. The prediction value is defined as<disp-formula id="e10">
<mml:math id="m23">
<mml:mrow>
<mml:mi>r</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>x</mml:mi>
<mml:mo>;</mml:mo>
<mml:msub>
<mml:mi>&#x3b8;</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>&#x3b8;</mml:mi>
<mml:mi>M</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mi>n</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mi>M</mml:mi>
</mml:mfrac>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>M</mml:mi>
</mml:munderover>
<mml:mrow>
<mml:mi>r</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>x</mml:mi>
<mml:mo>;</mml:mo>
<mml:msub>
<mml:mi>&#x3b8;</mml:mi>
<mml:mi>m</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mi>n</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:mstyle>
<mml:mo>,</mml:mo>
</mml:mrow>
</mml:math>
<label>(8)</label>
</disp-formula>where <inline-formula id="inf16">
<mml:math id="m24">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3b8;</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>&#x3b8;</mml:mi>
<mml:mi>M</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> are random variables and <inline-formula id="inf17">
<mml:math id="m25">
<mml:mrow>
<mml:mi>r</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:mi>x</mml:mi>
<mml:mo>;</mml:mo>
<mml:msub>
<mml:mi>&#x3b8;</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>&#x3b8;</mml:mi>
<mml:mi>M</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mi>n</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> is the predicted value at the point x for the m-th tree. The structure of NRF with independent training is shown in <xref ref-type="fig" rid="F1">Figure 1</xref>.</p>
<fig id="F1" position="float">
<label>FIGURE 1</label>
<caption>
<p>NRF model structure with independent training.</p>
</caption>
<graphic xlink:href="feart-10-888933-g001.tif"/>
</fig>
<p>For the joint training, the individual tree networks are concatenated into one network and then fitted based on the whole model. The final estimate is obtained by minimizing the empirical error.<disp-formula id="e11">
<mml:math id="m26">
<mml:mrow>
<mml:msub>
<mml:mi>J</mml:mi>
<mml:mi>n</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>f</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mi>n</mml:mi>
</mml:mfrac>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:munderover>
<mml:mrow>
<mml:msup>
<mml:mrow>
<mml:mrow>
<mml:mo>&#x7c;</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>Y</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>f</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>X</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mo>&#x7c;</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:msup>
</mml:mrow>
</mml:mstyle>
<mml:mo>,</mml:mo>
</mml:mrow>
</mml:math>
<label>(9)</label>
</disp-formula>where <inline-formula id="inf18">
<mml:math id="m27">
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>X</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> is the neural network implementing functions, <inline-formula id="inf19">
<mml:math id="m28">
<mml:mrow>
<mml:msub>
<mml:mi>Y</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the actual data, and n is the number of samples.</p>
<p>The structure of NRF with joint training is shown in <xref ref-type="fig" rid="F2">Figure 2</xref>.</p>
<fig id="F2" position="float">
<label>FIGURE 2</label>
<caption>
<p>NRF model structure with joint training.</p>
</caption>
<graphic xlink:href="feart-10-888933-g002.tif"/>
</fig>
<p>The activation function in this model is the hyperbolic tangent activation function. This function can provide better generalization and favor smoother decision boundaries. The hyperbolic tangent activation function is defined as<disp-formula id="e12">
<mml:math id="m29">
<mml:mrow>
<mml:mi>tanh</mml:mi>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mi>x</mml:mi>
<mml:mo>)</mml:mo>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:msup>
<mml:mi>e</mml:mi>
<mml:mi>x</mml:mi>
</mml:msup>
<mml:mo>&#x2212;</mml:mo>
<mml:msup>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>x</mml:mi>
</mml:mrow>
</mml:msup>
</mml:mrow>
<mml:mrow>
<mml:msup>
<mml:mi>e</mml:mi>
<mml:mi>x</mml:mi>
</mml:msup>
<mml:mo>&#x2b;</mml:mo>
<mml:msup>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>x</mml:mi>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:mfrac>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:msup>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:mn>2</mml:mn>
<mml:mi>x</mml:mi>
</mml:mrow>
</mml:msup>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:msup>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:mn>2</mml:mn>
<mml:mi>x</mml:mi>
</mml:mrow>
</mml:msup>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfrac>
<mml:mo>.</mml:mo>
</mml:mrow>
</mml:math>
<label>(10)</label>
</disp-formula>
</p>
</sec>
</sec>
<sec id="s2-2">
<title>2.2 Model Evaluation Criteria</title>
<p>In our experiments, four predictive metrics are calculated to assess the performance of the prediction results of well logs, namely, the coefficient of determination (R<sup>2</sup>), mean absolute error (MAE), mean squared error (MSE), and root mean square error (RMSE).</p>
<p>The R<sup>2</sup> demonstrates the prediction accuracy of the proposed method. The MAE describes an average difference between the predicted and actual measurements. RMSE denotes the standard deviation between the predictions of the model and actual data.</p>
<p>The three criteria are defined below:<disp-formula id="e13">
<mml:math id="m30">
<mml:mrow>
<mml:msup>
<mml:mi>R</mml:mi>
<mml:mn>2</mml:mn>
</mml:msup>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:munderover>
<mml:mrow>
<mml:msup>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mover accent="true">
<mml:mi>y</mml:mi>
<mml:mo>&#x2322;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:mrow>
<mml:mover accent="true">
<mml:mi>y</mml:mi>
<mml:mo>&#xaf;</mml:mo>
</mml:mover>
</mml:mrow>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:msup>
</mml:mrow>
</mml:mstyle>
</mml:mrow>
<mml:mrow>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:munderover>
<mml:mrow>
<mml:msup>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:mrow>
<mml:mover accent="true">
<mml:mi>y</mml:mi>
<mml:mo>&#xaf;</mml:mo>
</mml:mover>
</mml:mrow>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:msup>
</mml:mrow>
</mml:mstyle>
</mml:mrow>
</mml:mfrac>
<mml:mo>,</mml:mo>
</mml:mrow>
</mml:math>
<label>(11)</label>
</disp-formula>
<disp-formula id="e14">
<mml:math id="m31">
<mml:mrow>
<mml:mi>M</mml:mi>
<mml:mi>A</mml:mi>
<mml:mi>E</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mi>N</mml:mi>
</mml:mfrac>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:munderover>
<mml:mrow>
<mml:mrow>
<mml:mo>&#x7c;</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mover accent="true">
<mml:mi>y</mml:mi>
<mml:mo>&#x2322;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mover accent="true">
<mml:mi>y</mml:mi>
<mml:mo>&#xaf;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo>&#x7c;</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:mstyle>
<mml:mo>,</mml:mo>
</mml:mrow>
</mml:math>
<label>(12)</label>
</disp-formula>
<disp-formula id="e15">
<mml:math id="m32">
<mml:mrow>
<mml:mi>R</mml:mi>
<mml:mi>M</mml:mi>
<mml:mi>S</mml:mi>
<mml:mi>E</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:msqrt>
<mml:mrow>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mi>n</mml:mi>
</mml:mfrac>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:munderover>
<mml:mrow>
<mml:msup>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mover accent="true">
<mml:mi>y</mml:mi>
<mml:mo>&#x2322;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:msup>
</mml:mrow>
</mml:mstyle>
</mml:mrow>
</mml:msqrt>
<mml:mo>,</mml:mo>
</mml:mrow>
</mml:math>
<label>(13)</label>
</disp-formula>where n is the number of samples, <inline-formula id="inf20">
<mml:math id="m33">
<mml:mrow>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the i-th actual value, <inline-formula id="inf21">
<mml:math id="m34">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mover accent="true">
<mml:mi>y</mml:mi>
<mml:mo>&#x2322;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the i-th predicted value, and <inline-formula id="inf22">
<mml:math id="m35">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mover accent="true">
<mml:mi>y</mml:mi>
<mml:mo>&#xaf;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the average of n.</p>
</sec>
</sec>
<sec id="s3">
<title>3 Experiments and Discussion</title>
<p>In this section, the experiments are conducted for shale gas reservoirs. The proposed model is to search the complex nonlinear relationship between the well logs and physical parameters, and efficiently predict the porosity and saturation of blind wells.</p>
<p>All experimental studies were carried out in the Python 3.6 compiling environment using Anaconda. All artificial intelligence models were developed using TensorFlow (<xref ref-type="bibr" rid="B1">Abadi et al., 2016</xref>).</p>
<sec id="s3-1">
<title>3.1 Dataset</title>
<p>To evaluate the performance of the proposed approach, we selected the logging data of six classic wells (Well-1, Well-2, Well-3, Well-4, Well-5, and Well-6) from the study area, and the shale gas reservoirs at the Chongqing oilfield in China comprise the dataset for the prediction of porosity and saturation. We selected six logging curves from each well, namely depth (DEPTH), borehole diameter (CAL), neutron (CNL), gamma ray (GR), density (DEN), acoustic (AC), and deep investigate double lateral resistivity log (RD). The depth of six wells is 2000&#x2013;3000&#xa0;m. The sampling interval is 0.125&#xa0;m. In addition, the porosity and saturation data are calculated using the petrophysical volume model. To validate the accuracy of the calculated results, we compared them with the core test results, and they matched very well. Therefore, we regard the calculated porosity and saturation results as the &#x201c;actual&#x201d; data. For the machine learning model to learn the best permutation sequence between the input and target vectors, the well log data are subdivided into a training set and a test set. To improve the accuracy of prediction, it is necessary to carry out data preprocessing.</p>
<p>The research area of six wells is first determined by manual selection. Then, the null data from six wells are discarded. Furthermore, the noise data are filtered using the wavelet transform technique. The wavelet transform technique can decompose a signal into multiple lower resolution levels by controlling the scaling and shifting factors of a single wavelet function (<xref ref-type="bibr" rid="B10">Foufoula-Georgiou et al., 1994</xref>; <xref ref-type="bibr" rid="B16">Lau and Weng, 1995</xref>; <xref ref-type="bibr" rid="B28">Torrence and Compo, 1998</xref>; <xref ref-type="bibr" rid="B18">Percival, 2000</xref>). After the wavelet transform technique, the noise data are filtered, and high quality data are obtained.</p>
<p>In our experiments, CAL, CNL, GR, DEN AC, and RD logging curves are denoised using the wavelet transform technique taking the CNL logging curve from Well-1 as an example. The comparisons of the logging curves before and after denoising are depicted in <xref ref-type="fig" rid="F3">Figure 3</xref>. It can be seen that the data are smoother after wavelet denoising and the denoising effect is more pronounced in the red circle marked in the picture.</p>
<fig id="F3" position="float">
<label>FIGURE 3</label>
<caption>
<p>Effect of denoising for the CNL logging curve.</p>
</caption>
<graphic xlink:href="feart-10-888933-g003.tif"/>
</fig>
</sec>
<sec id="s3-2">
<title>3.2 NRF Architecture and Procedure</title>
<p>In this study, we built a porosity and saturation prediction model separately based on the NRF algorithm and designed the model&#x2019;s framework. The overall structure of this work is illustrated in <xref ref-type="fig" rid="F4">Figure 4</xref>.</p>
<fig id="F4" position="float">
<label>FIGURE 4</label>
<caption>
<p>Structure of this work.</p>
</caption>
<graphic xlink:href="feart-10-888933-g004.tif"/>
</fig>
<p>The neural network in the NRF model has four layers which use a backpropagation algorithm. The hyperbolic tangent function is used on the hidden layers, and Adam optimizer is used during the training process to avoid overfitting. In addition, the trees number of RF included in the NRF model is 30 and the max depth is 6.</p>
<p>The steps used to develop and implement the proposed model are summarized in the following text:</p>
<p>
<statement content-type="step" id="Step_1">
<label>Step 1</label>
<p>Well log selection: The input and output vector for the proposed model are determined and specified.</p>
</statement>
</p>
<p>
<statement content-type="step" id="Step_2">
<label>Step 2</label>
<p>Data preprocessing: This involves discarding invalid data and denoising data using the wavelet transform technique.</p>
</statement>
</p>
<p>
<statement content-type="step" id="Step_3">
<label>Step 3</label>
<p>Data division: The processed data are split into the training set and testing set.</p>
</statement>
</p>
<p>
<statement content-type="step" id="Step_4">
<label>Step 4</label>
<p>NRF architecture construction: This consists of collaborating the neural network and RF. The related parameters should also be set at this stage.</p>
</statement>
</p>
<p>
<statement content-type="step" id="Step_5">
<label>Step 5</label>
<p>NRF model training: The relationship between the input and output vectors is obtained through the NRF model.</p>
</statement>
</p>
<p>
<statement content-type="step" id="Step_6">
<label>Step 6</label>
<p>Physical parameters prediction: Based on the trained NRF model in Step 5, the porosity and saturation of the blind well are predicted.</p>
</statement>
</p>
<p>
<statement content-type="step" id="Step_7">
<label>Step 7</label>
<p>Result comparison: To evaluate the performance of the proposed model, the baseline models, NN and RF, were compared.</p>
</statement>
</p>
</sec>
<sec id="s3-3">
<title>3.3 Experiment Results and Discussion</title>
<p>In our experiments, the NRF model was trained in two ways: independent training and joint training. For simplicity, the NRF model with independent training is named NRF1, and the NRF model with joint training is named NRF2. We first validate the performance of denoising based on the wavelet transforms. The predictive performance of saturation is taken as an example, and the results are shown in <xref ref-type="table" rid="T1">Table 1</xref>.</p>
<table-wrap id="T1" position="float">
<label>TABLE 1</label>
<caption>
<p>Comparison of predictive results of saturation before and after denoising using wavelet transforms.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="left">Method</th>
<th align="center">MAE</th>
<th align="center">MSE</th>
<th align="center">RMSE</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="left">NRF1-before-denoise</td>
<td align="char" char=".">19.754</td>
<td align="char" char=".">2.280</td>
<td align="char" char=".">4.444</td>
</tr>
<tr>
<td align="left">NRF1-after-denoise</td>
<td align="char" char=".">9.068</td>
<td align="char" char=".">2.195</td>
<td align="char" char=".">3.011</td>
</tr>
<tr>
<td align="left">NRF2-before-denoise</td>
<td align="char" char=".">17.522</td>
<td align="char" char=".">1.902</td>
<td align="char" char=".">4.185</td>
</tr>
<tr>
<td align="left">NRF2-after-denoise</td>
<td align="char" char=".">7.470</td>
<td align="char" char=".">1.836</td>
<td align="char" char=".">2.733</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>It is demonstrated in <xref ref-type="table" rid="T1">Table 1</xref> that the NRF models can achieve better results with lower error after denoising technique. Therefore, it is necessary and significant to denoise to obtain high-quality data.</p>
<p>Based on the processed data, the performance of different prediction models are compared. As the proposed NRF model makes up of the neural network and random forest, the standard neural network and random forest are compared together. These four models (NRF1, NRF2, NN, and RF) are used for forecasting porosity and saturation of the study reservoir. To represent the fit of the logging curve more visually, the predicted and actual logging data with depth are depicted in <xref ref-type="fig" rid="F5">Figure 5</xref>. The red line denotes the measured data, the blue line means the predicted data, and the dots indicate the core test values.</p>
<fig id="F5" position="float">
<label>FIGURE 5</label>
<caption>
<p>Comparison between actual and predicted porosity data in different models (Well-6).</p>
</caption>
<graphic xlink:href="feart-10-888933-g005.tif"/>
</fig>
<p>It was found that most of the predicted values using the NN model did not fall on the perfect linear trend line and have the worst performance, while other three methods fit well.</p>
<p>To compare the results further, part of the well logs is selected to be analyzed specifically (the red box in <xref ref-type="fig" rid="F5">Figure 5</xref>). The selected part is from the middle of the logging with a depth of 3210&#x2013;3330&#xa0;m (<xref ref-type="fig" rid="F6">Figure 6</xref>). This part is 120&#xa0;m, which contains 960 samples.</p>
<fig id="F6" position="float">
<label>FIGURE 6</label>
<caption>
<p>Comparison results of different models for porosity (depth: 3210&#x2013;3330&#xa0;m).</p>
</caption>
<graphic xlink:href="feart-10-888933-g006.tif"/>
</fig>
<p>From <xref ref-type="fig" rid="F6">Figure 6</xref>, it is demonstrated that the forecast accuracy of porosity obtained by the NN has a large error zone, while the prediction using the RF model has been enhanced. Using the combination of the NN and RF algorithms, the prediction accuracy has been further improved evidently. Therefore, the NRF model can be a powerful tool for predicting the porosity based on well logging data.</p>
<p>The predicted results for saturation are also depicted in <xref ref-type="fig" rid="F7">Figure 7</xref>. Similarly, the red line denotes the measured saturation value, and the blue line means the predicted data. It was found that the predictions of four models fluctuate greatly around the standard measured values, and the prediction of saturation is not as good as the prediction of porosity.</p>
<fig id="F7" position="float">
<label>FIGURE 7</label>
<caption>
<p>Comparison between actual and predicted saturation data in different models (Well-6).</p>
</caption>
<graphic xlink:href="feart-10-888933-g007.tif"/>
</fig>
<p>To compare the results further, the well logging curves with a depth of 3650&#x2013;4100&#xa0;m are selected (the red box in <xref ref-type="fig" rid="F7">Figure 7</xref>). This part is 450&#xa0;m, which contains 3,600 sample. The details are depicted in <xref ref-type="fig" rid="F8">Figure 8</xref>.</p>
<fig id="F8" position="float">
<label>FIGURE 8</label>
<caption>
<p>Comparison results of different models for saturation (depth: 3650&#x2013;4100&#xa0;m).</p>
</caption>
<graphic xlink:href="feart-10-888933-g008.tif"/>
</fig>
<p>It can be drawn from <xref ref-type="fig" rid="F8">Figure 8</xref> that the forecast accuracy of saturation obtained by the NN has a large error zone. The prediction using the RF model is competitive to the NRF1 model, while the prediction accuracy has been further improved using the NRF2 model. Therefore, the NRF2 model is chosen to predict saturation based on well logging data.</p>
<p>To provide a qualitative analysis of the model prediction, the R<sup>2</sup>, MAE, MSE, and RMSE are calculated for porosity and saturation prediction models, respectively.</p>
<p>The qualitative analysis results of the predicted porosity and saturation from four models are shown in <xref ref-type="table" rid="T2">Table 2</xref>. For the prediction of porosity, it is demonstrated that among the classic machine learning algorithms (NN and RF), RF works much better due to the majority voting mechanism, with the R<sup>2</sup> of 0.913, MAE of 0.066, MSE of 0.201, and RMSE of 0.226. The NRF1 model whose R<sup>2</sup> is 0.941 performs very close to the NRF2 model. Comparingly, the NRF2 model is superior, and it yields the best R<sup>2</sup>, which is 1.1% higher than the NRF1 model, 3.9% higher than the RF, and greatly higher than the NN. It is worth noting that our proposed NRF model significantly outperforms the baseline models, resulting in at least 3% improvement in the prediction accuracy.</p>
<table-wrap id="T2" position="float">
<label>TABLE 2</label>
<caption>
<p>Qualitative analysis of predicted porosity and saturation results from four models.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="left">Method for porosity</th>
<th align="center">R<sup>2</sup>
</th>
<th align="center">MAE</th>
<th align="center">MSE</th>
<th align="center">RMSE</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="left">NN</td>
<td align="center">0.256</td>
<td align="center">2.096</td>
<td align="center">0.985</td>
<td align="center">1.462</td>
</tr>
<tr>
<td align="left">RF</td>
<td align="center">0.913</td>
<td align="center">0.066</td>
<td align="center">0.201</td>
<td align="center">0.226</td>
</tr>
<tr>
<td align="left">NRF1</td>
<td align="center">0.941</td>
<td align="center">0.047</td>
<td align="center">0.153</td>
<td align="center">0.186</td>
</tr>
<tr>
<td align="left">NRF2</td>
<td align="center">0.952</td>
<td align="center">0.039</td>
<td align="center">0.114</td>
<td align="center">0.162</td>
</tr>
<tr>
<td colspan="5" align="left">Method for saturation</td>
</tr>
<tr>
<td align="left">&#x2003;NN</td>
<td align="center">0.363</td>
<td align="center">24.821</td>
<td align="center">3.069</td>
<td align="center">4.865</td>
</tr>
<tr>
<td align="left">&#x2003;RF</td>
<td align="center">0.774</td>
<td align="center">9.040</td>
<td align="center">2.193</td>
<td align="center">3.006</td>
</tr>
<tr>
<td align="left">&#x2003;NRF1</td>
<td align="center">0.823</td>
<td align="center">8.845</td>
<td align="center">1.902</td>
<td align="center">2.942</td>
</tr>
<tr>
<td align="left">&#x2003;NRF2</td>
<td align="center">0.844</td>
<td align="center">7.169</td>
<td align="center">1.836</td>
<td align="center">2.135</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>It can be noticed that all the four models have a poorer capability of predicting saturation than porosity. This is attributed to the strong correlation of the logging curves applied with porosity and the weak mapping to saturation. Nevertheless, the proposed NRF model, especially the NRF2 model, provides high accuracy prediction for saturation, with R<sup>2</sup> above 80%.</p>
<p>Moreover, we generated the histograms of porosity and saturation in the target well and predicted the values using four algorithms (<xref ref-type="fig" rid="F9">Figures 9</xref>, <xref ref-type="fig" rid="F10">10</xref>). The horizontal coordinates denote the range of data and the longitudinal coordinates means the amount of data in different range, presented as a percent format. The histograms can obviously reflect the distribution, the center, and dispersion of data.</p>
<fig id="F9" position="float">
<label>FIGURE 9</label>
<caption>
<p>Histogram of porosity data distribution.</p>
</caption>
<graphic xlink:href="feart-10-888933-g009.tif"/>
</fig>
<fig id="F10" position="float">
<label>FIGURE 10</label>
<caption>
<p>Histogram of saturation data distribution.</p>
</caption>
<graphic xlink:href="feart-10-888933-g010.tif"/>
</fig>
<p>It can be drawn from <xref ref-type="fig" rid="F9">Figure 9</xref> that the porosity data of Well-6 are consistent with normal distribution and the center of data is 5, which is named the standard center point. As for the predicted results from the neural network, the data are roughly in accordance with normal distribution, but the center of data is about 3, which is far away from the standard center point. The predicted results of the RF model have a large dispersion and the center point is around 4.5, which is still far away from the standard center point. In comparison, the NRF with the independent and joint training is similar with the distribution of actual porosity data, and the center of the data is near the standard center point.</p>
<p>As can be seen in <xref ref-type="fig" rid="F10">Figure 10</xref>, the saturation value for Well-6 conforms to a normal distribution, while the distribution of predicted values for the NN, RF, and NRF1 models does not fit. In comparison, the results from the NRF2 model have a normal distribution, and the center point is the same with the standard center point. Consequently, the NRF2 model can be employed to predict the saturation of shale gas reservoirs.</p>
<p>A qualitative analysis of the results from four models is also provided by calculating the minimum (Min), maximum (Max), mean of all data in each model (Mean), standard deviation (Std Dev), and Variance (Var).</p>
<p>The Var is expressed as<disp-formula id="e16">
<mml:math id="m36">
<mml:mrow>
<mml:mi>V</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>r</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mi>n</mml:mi>
</mml:mfrac>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:munderover>
<mml:mrow>
<mml:msup>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:mrow>
<mml:mover accent="true">
<mml:mi>y</mml:mi>
<mml:mo>&#xaf;</mml:mo>
</mml:mover>
</mml:mrow>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:msup>
</mml:mrow>
</mml:mstyle>
<mml:mo>.</mml:mo>
</mml:mrow>
</mml:math>
<label>(14)</label>
</disp-formula>
</p>
<p>The Std Dev is calculated by<disp-formula id="e17">
<mml:math id="m37">
<mml:mrow>
<mml:mi>S</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>d</mml:mi>
<mml:mi>D</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>v</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:msqrt>
<mml:mrow>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mi>n</mml:mi>
</mml:mfrac>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:munderover>
<mml:mrow>
<mml:msup>
<mml:mrow>
<mml:mrow>
<mml:mo>(</mml:mo>
<mml:mrow>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mover accent="true">
<mml:mi>y</mml:mi>
<mml:mo>&#xaf;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mo>)</mml:mo>
</mml:mrow>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:msup>
</mml:mrow>
</mml:mstyle>
</mml:mrow>
</mml:msqrt>
<mml:mo>,</mml:mo>
</mml:mrow>
</mml:math>
<label>(15)</label>
</disp-formula>where <inline-formula id="inf23">
<mml:math id="m38">
<mml:mi>n</mml:mi>
</mml:math>
</inline-formula> is the number of samples, <inline-formula id="inf24">
<mml:math id="m39">
<mml:mrow>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> denotes the data to be assessed, and <inline-formula id="inf25">
<mml:math id="m40">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mover accent="true">
<mml:mi>y</mml:mi>
<mml:mo>&#xaf;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the mean of all samples.</p>
<p>The consequences are shown in <xref ref-type="table" rid="T3">Table 3</xref>.</p>
<table-wrap id="T3" position="float">
<label>TABLE 3</label>
<caption>
<p>Qualitative analysis of data distribution for porosity and saturation from the actual data and predicted results.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="left">Method for porosity</th>
<th align="center">Min</th>
<th align="center">Max</th>
<th align="center">Mean</th>
<th align="center">Var</th>
<th align="center">Std. Dev.</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="left">Actual</td>
<td align="center">0.53</td>
<td align="center">9.43</td>
<td align="center">4.88</td>
<td align="center">0.82</td>
<td align="center">0.91</td>
</tr>
<tr>
<td align="left">NN</td>
<td align="center">&#x2212;3.45</td>
<td align="center">20.13</td>
<td align="center">4.12</td>
<td align="center">1.09</td>
<td align="center">1.04</td>
</tr>
<tr>
<td align="left">RF</td>
<td align="center">0.78</td>
<td align="center">9.34</td>
<td align="center">4.49</td>
<td align="center">0.82</td>
<td align="center">0.90</td>
</tr>
<tr>
<td align="left">NRF1</td>
<td align="center">0.51</td>
<td align="center">9.68</td>
<td align="center">4.78</td>
<td align="center">0.83</td>
<td align="center">0.91</td>
</tr>
<tr>
<td align="left">NRF2</td>
<td align="center">0.66</td>
<td align="center">9.58</td>
<td align="center">4.80</td>
<td align="center">0.81</td>
<td align="center">0.90</td>
</tr>
<tr>
<td colspan="6" align="left">Method for saturation</td>
</tr>
<tr>
<td align="left">&#x2003;Actual</td>
<td align="center">3.80</td>
<td align="center">78.35</td>
<td align="center">21.43</td>
<td align="center">40.14</td>
<td align="center">6.34</td>
</tr>
<tr>
<td align="left">&#x2003;NN</td>
<td align="center">3.12</td>
<td align="center">63.45</td>
<td align="center">22.34</td>
<td align="center">44.96</td>
<td align="center">6.70</td>
</tr>
<tr>
<td align="left">&#x2003;RF</td>
<td align="center">10.25</td>
<td align="center">55.21</td>
<td align="center">20.17</td>
<td align="center">35.58</td>
<td align="center">5.96</td>
</tr>
<tr>
<td align="left">&#x2003;NRF1</td>
<td align="center">10.02</td>
<td align="center">56.41</td>
<td align="center">21.64</td>
<td align="center">34.86</td>
<td align="center">5.90</td>
</tr>
<tr>
<td align="left">&#x2003;NRF2</td>
<td align="center">9.31</td>
<td align="center">58.02</td>
<td align="center">21.27</td>
<td align="center">32.04</td>
<td align="center">5.66</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>For the prediction of porosity and saturation, it can be concluded from <xref ref-type="table" rid="T3">Table 3</xref> that the predicted results from the NRF2 model have the closest value of mean, standard deviation, and variance with the actual data, which means this model has a similar distribution with the actual measured porosity and saturation data. In addition, it also demonstrates greater stability and better performance. In this case, the NRF1 method is slightly inferior to the NRF2 method. It is noted that for the prediction of saturation, the NN model obtains close qualitative values with the actual data. However, it does not imply that this algorithm has better performance according to <xref ref-type="fig" rid="F7">Figures 7</xref>, <xref ref-type="fig" rid="F8">8</xref>.</p>
<p>Therefore, from the perspective of data distribution, the superiority of the algorithm proposed in this article is further illustrated.</p>
<p>It is crucial to notice that the models created in the present research are suitable only for the shale gas reservoir. When the same methodologies used are presented in this research, it is necessary to retrain the model with the data in the respective area.</p>
</sec>
</sec>
<sec id="s4">
<title>4 Conclusion</title>
<p>In this study, a novel hybrid model combining the neural network and random forest is proposed for predicting the porosity and saturation based on well logging of the shale gas reservoir. The ability of the proposed model to forecast porosity and saturation is discussed. Meanwhile, the proposed model is also compared with the baseline methods, namely, NN and RF. The main conclusions are as follows:<list list-type="simple">
<list-item>
<p>1. The proposed NRF model provided a promising method for predicting the porosity and saturation, as evidenced by the satisfactory performance on porosity data with R<sup>2</sup> above 0.94 and saturation data with R<sup>2</sup> above 0.82. It can serve as an alternative tool to give a reliable prediction.</p>
</list-item>
<list-item>
<p>2. The proposed NRF model outperformed the classical neural networks and random forest models. In comparison, for the prediction of porosity, the RF algorithm worked much better than the NN model with R<sup>2</sup> above 0.91. The NRF2 model obtained the unsurpassed performance with R<sup>2</sup> above 0.95, which is 1.1% higher than that of the NRF1 model, 3.9% higher than RF, and greatly higher than the NN. For the prediction of saturation, the NRF2 model with R<sup>2</sup> above 0.84 is also superior than other algorithms, which is 2.1% higher than the NRF1 model and 7.0% higher than the RF model. It has been proven that the NRF2 model can more accurately capture the complex relationship between the logging data and physical parameters.</p>
</list-item>
<list-item>
<p>3. In terms of the histogram of data distribution, the NRF2 method demonstrated greater stability, while the NRF1 method was slightly inferior in the study case. Therefore, the superiority of the algorithm proposed in this article is further illustrated.</p>
</list-item>
</list>
</p>
<p>In the future, we will investigate the logging data and other physical properties.</p>
</sec>
</body>
<back>
<sec id="s5">
<title>Data Availability Statement</title>
<p>The raw data supporting the conclusion of this article will be made available by the authors, without undue reservation.</p>
</sec>
<sec id="s6">
<title>Author Contributions</title>
<p>MW contributed to the conception and design of the study, and wrote the first draft of the manuscript. DF supervised this investigation. DL wrote sections of the manuscript. JW contributed to manuscript revision.</p>
</sec>
<sec id="s7">
<title>Funding</title>
<p>This work was supported by the Sinopec Science and Technology Tackle Project (P19017-2).</p>
</sec>
<sec sec-type="COI-statement" id="s8">
<title>Conflict of Interest</title>
<p>The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.</p>
</sec>
<sec sec-type="disclaimer" id="s9">
<title>Publisher&#x2019;s Note</title>
<p>All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors, and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.</p>
</sec>
<ref-list>
<title>References</title>
<ref id="B1">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Abadi</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Barham</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Davis</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Dean</surname>
<given-names>J.</given-names>
</name>
<etal/>
</person-group> (<year>2016</year>). <source>TensorFlow: A System for Large-Scale Machine Learning</source>. </citation>
</ref>
<ref id="B2">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Akande</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Owolabi</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Olatunji</surname>
<given-names>S.</given-names>
</name>
</person-group> (<year>2015</year>). <article-title>Investigating the Effect of Correlation-Based Feature Selection on the Performance of Neural Network in Reservoir Characterization[J]</article-title>. <source>J. Nat. Gas Sci. Eng.</source> <volume>27</volume>, <fpage>S1875510015301074</fpage>. <pub-id pub-id-type="doi">10.1016/j.jngse.2015.08.042</pub-id> </citation>
</ref>
<ref id="B3">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Basheer</surname>
<given-names>I. A.</given-names>
</name>
<name>
<surname>Hajmeer</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2000</year>). <article-title>Artificial Neural Networks: Fundamentals, Computing, Design, and Application</article-title>. <source>J. Microbiol. Methods</source> <volume>43</volume>, <fpage>3</fpage>&#x2013;<lpage>31</lpage>. <pub-id pub-id-type="doi">10.1016/s0167-7012(00)00201-3</pub-id> </citation>
</ref>
<ref id="B4">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Biau</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Scornet</surname>
<given-names>E.</given-names>
</name>
<name>
<surname>Welbl</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>Neural Random Forests</article-title>. <source>Sankhya A</source> <volume>81</volume>, <fpage>347</fpage>&#x2013;<lpage>386</lpage>. <pub-id pub-id-type="doi">10.1007/s13171-018-0133-y</pub-id> </citation>
</ref>
<ref id="B5">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Breiman</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Friedman</surname>
<given-names>J. H.</given-names>
</name>
<name>
<surname>Olshen</surname>
<given-names>R. A.</given-names>
</name>
<name>
<surname>Stone</surname>
<given-names>C.</given-names>
</name>
</person-group> (<year>1984</year>). <source>Classification and Regression Trees</source>. <publisher-name>Wadsworth and Brooks/Cole Advanced Books and Software</publisher-name>. </citation>
</ref>
<ref id="B6">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Breiman</surname>
<given-names>L.</given-names>
</name>
</person-group> (<year>2001</year>). <article-title>Random forest</article-title>. <source>Mach. Learn.</source> <volume>45</volume>, <fpage>5</fpage>&#x2013;<lpage>32</lpage>. <pub-id pub-id-type="doi">10.1023/a:1010933404324</pub-id> </citation>
</ref>
<ref id="B7">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Despoina</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Pauline</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Yining</surname>
<given-names>C.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>A Random forest-based Approach for Predicting Spreads in the Primary Catastrophe Bond Market</article-title>. <source>Insurance: Maths. Econ.</source> <volume>101</volume>, <fpage>140</fpage>&#x2013;<lpage>162</lpage>. <pub-id pub-id-type="doi">10.1016/j.insmatheco.2021.07.003</pub-id> </citation>
</ref>
<ref id="B9">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Eberhart</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Shi</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>2001</year>). &#x201c;<article-title>Particle Swarm Optimization: Developments, Applications and Resources</article-title>,&#x201d; in <conf-name>Proceedings of the 2001 Congress on Evolutionary Computation</conf-name>, <conf-loc>Seoul, Korea</conf-loc>, <conf-date>May 2001</conf-date> (<publisher-name>IEEE</publisher-name>), <fpage>81</fpage>&#x2013;<lpage>86</lpage>. </citation>
</ref>
<ref id="B10">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Foufoula-Georgiou</surname>
<given-names>E.</given-names>
</name>
<name>
<surname>Kumar</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Chui</surname>
<given-names>C. K.</given-names>
</name>
</person-group> (<comment>Editors</comment>) (<year>1994</year>). <source>Wavelets in Geophysics</source>. <publisher-name>Academic Press</publisher-name>, <volume>Vol. 4</volume>. </citation>
</ref>
<ref id="B11">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Gardner</surname>
<given-names>M. W.</given-names>
</name>
<name>
<surname>Dorling</surname>
<given-names>S. R.</given-names>
</name>
</person-group> (<year>1998</year>). <article-title>Artificial Neural Networks (The Multilayer Perceptron)-A Review of Applications in the Atmospheric Sciences</article-title>. <source>Atmos. Environ.</source> <volume>32</volume>, <fpage>2627</fpage>&#x2013;<lpage>2636</lpage>. <pub-id pub-id-type="doi">10.1016/s1352-2310(97)00447-0</pub-id> </citation>
</ref>
<ref id="B12">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Hadi</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Sadegh</surname>
<given-names>K.</given-names>
</name>
</person-group> (<year>2016</year>). <article-title>Prediction of Porosity and Water Saturation Using Pre-stack Seismic Attributes: a Comparison of Bayesian Inversion and Computational Intelligence Methods[J]</article-title>. <source>Comput. Geosciences</source> <volume>20</volume> (<issue>5</issue>), <fpage>1075</fpage>&#x2013;<lpage>1094</lpage>. <pub-id pub-id-type="doi">10.1007/s10596-016-9577-0</pub-id> </citation>
</ref>
<ref id="B13">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Kennedy</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Eberhart</surname>
<given-names>R.</given-names>
</name>
</person-group> (<year>1995</year>). &#x201c;<article-title>Particle Swarm Optimization</article-title>,&#x201d; in <conf-name>Proc. Int. Conf. Neural Networks</conf-name>, <conf-loc>Perth, WA, Australia</conf-loc>, <conf-date>27 Nov.-1 Dec. 1995</conf-date> (<publisher-name>IEEE</publisher-name>), <fpage>1942</fpage>&#x2013;<lpage>1948</lpage>. <pub-id pub-id-type="doi">10.1109/ICNN.1995.488968</pub-id> </citation>
</ref>
<ref id="B14">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Khandelwal</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Singh</surname>
<given-names>T. N.</given-names>
</name>
</person-group> (<year>2010</year>). <article-title>Artificial Neural Networks as a Valuable Tool for Well Log Interpretation</article-title>. <source>Pet. Sci. Tech.</source> <volume>28</volume>, <fpage>1381</fpage>&#x2013;<lpage>1393</lpage>. <pub-id pub-id-type="doi">10.1080/10916460903030482</pub-id> </citation>
</ref>
<ref id="B15">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Komarialaei</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Salahshoor</surname>
<given-names>K.</given-names>
</name>
</person-group> (<year>2012</year>). <article-title>The Design of New Soft Sensors Based on PCA and a Neural Network for Parameters Estimation of a Petroleum Reservoir[J]</article-title>. <source>Liquid Fuels Tech.</source> <volume>30</volume> (<issue>22</issue>), <fpage>12</fpage>. <pub-id pub-id-type="doi">10.1080/10916466.2010.512899</pub-id> </citation>
</ref>
<ref id="B16">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Lau</surname>
<given-names>K.-M.</given-names>
</name>
<name>
<surname>Weng</surname>
<given-names>H.</given-names>
</name>
</person-group> (<year>1995</year>). <article-title>Climate Signal Detection Using Wavelet Transform: How to Make a Time Series Sing</article-title>. <source>Bull. Amer. Meteorol. Soc.</source> <volume>76</volume>, <fpage>2391</fpage>&#x2013;<lpage>2402</lpage>. <pub-id pub-id-type="doi">10.1175/1520-0477(1995)076&#x3c;2391:csduwt&#x3e;2.0.co;2</pub-id> </citation>
</ref>
<ref id="B17">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Li</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Song</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Killough</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2016</year>). <article-title>An Analytical Method for Modeling and Analysis Gas-Water Relative Permeability in Nanoscale Pores with Interfacial Effects</article-title>. <source>Int. J. Coal Geology.</source> <volume>159</volume>, <fpage>71</fpage>&#x2013;<lpage>81</lpage>. <pub-id pub-id-type="doi">10.1016/j.coal.2016.03.018</pub-id> </citation>
</ref>
<ref id="B18">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Percival</surname>
<given-names>W.</given-names>
</name>
</person-group> (<year>2000</year>). <source>Wavelet Methods for Time Series Analysis</source>. <publisher-loc>Cambridge, UK</publisher-loc>: <publisher-name>Cambridge Univ. Press</publisher-name>. </citation>
</ref>
<ref id="B19">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Prieto</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Prieto</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Ortigosa</surname>
<given-names>E. M.</given-names>
</name>
<name>
<surname>Ros</surname>
<given-names>E.</given-names>
</name>
<name>
<surname>Pelayo</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Ortega</surname>
<given-names>J.</given-names>
</name>
<etal/>
</person-group> (<year>2016</year>). <article-title>Neural Networks: an Overview of Early Research, Current Frameworks and New Challenges</article-title>. <source>Neurocomputing</source> <volume>214</volume>, <fpage>242</fpage>&#x2013;<lpage>268</lpage>. <pub-id pub-id-type="doi">10.1016/j.neucom.2016.06.014</pub-id> </citation>
</ref>
<ref id="B20">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Raymer</surname>
<given-names>L. L.</given-names>
</name>
<name>
<surname>Hunt</surname>
<given-names>E. R.</given-names>
</name>
<name>
<surname>Gardner</surname>
<given-names>J. S.</given-names>
</name>
</person-group> (<year>1980</year>). &#x201c;<article-title>An Improved Sonic Transit Time-to-Porosity Transform</article-title>,&#x201d; in <conf-name>SPWLA 21st Annual Logging Symposium</conf-name>, <conf-loc>Lafayette, Louisiana</conf-loc>, <conf-date>July, 1980</conf-date> (<publisher-name>OnePetro</publisher-name>). </citation>
</ref>
<ref id="B8">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Richmond</surname>
<given-names>D. L.</given-names>
</name>
<name>
<surname>Kainmueller</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Yang</surname>
<given-names>M. Y.</given-names>
</name>
<name>
<surname>Myers</surname>
<given-names>E.</given-names>
</name>
<name>
<surname>Rother</surname>
<given-names>C.</given-names>
</name>
</person-group> (<year>2015</year>). <article-title>Relating Cascaded Random Forests to Deep Convolutional Neural Networks for Semantic Segmentation</article-title>. <comment>arXiv:1507.07583</comment>. </citation>
</ref>
<ref id="B21">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Rolon</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Mohaghegh</surname>
<given-names>S. D.</given-names>
</name>
<name>
<surname>Ameri</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Gaskari</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>McDaniel</surname>
<given-names>B.</given-names>
</name>
</person-group> (<year>2009</year>). <article-title>Using Artificial Neural Networks to Generate Synthetic Well Logs</article-title>. <source>J. Nat. Gas Sci. Eng.</source> <volume>1</volume>, <fpage>118</fpage>&#x2013;<lpage>133</lpage>. <pub-id pub-id-type="doi">10.1016/j.jngse.2009.08.003</pub-id> </citation>
</ref>
<ref id="B22">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Saputro</surname>
<given-names>O. D.</given-names>
</name>
<name>
<surname>Maulana</surname>
<given-names>Z. L.</given-names>
</name>
<name>
<surname>Latief</surname>
<given-names>F. D. E.</given-names>
</name>
</person-group> (<year>2016</year>). <article-title>Porosity Log Prediction Using Artificial Neural Network</article-title>. <source>J. Phys. Conf. Ser.</source> <volume>739</volume>, <fpage>012092</fpage>. <pub-id pub-id-type="doi">10.1088/1742-6596/739/1/012092</pub-id> </citation>
</ref>
<ref id="B23">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Schmidhuber</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2015</year>). <article-title>Deep Learning in Neural Networks: an Overview</article-title>. <source>Neural Networks</source> <volume>61</volume>, <fpage>85</fpage>&#x2013;<lpage>117</lpage>. <pub-id pub-id-type="doi">10.1016/J.NEUNET.2014.09.003</pub-id> </citation>
</ref>
<ref id="B24">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Song</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Gao</surname>
<given-names>Q.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>Z.</given-names>
</name>
</person-group> (<year>2016</year>). <article-title>Application of Random Forests for Regression to Seismic Reservoir Prediction[J]</article-title>. <source>Oil Geophys. Prospect.</source> <volume>51</volume> (<issue>6</issue>), <fpage>1202</fpage>&#x2013;<lpage>1211</lpage>. <pub-id pub-id-type="doi">10.13810/j.cnki.issn.1000-7210.2016.06.021</pub-id> </citation>
</ref>
<ref id="B25">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Song</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Xu</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Fang</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Cao</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Yang</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>T.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Potential for Mine Water Disposal in Coal Seam Goaf: Investigation of Storage Coefficients in the Shendong Mining Area</article-title>. <source>J. Clean. Prod.</source> <volume>244</volume>, <fpage>118646</fpage>. <pub-id pub-id-type="doi">10.1016/j.jclepro.2019.118646</pub-id> </citation>
</ref>
<ref id="B26">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Song</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Lao</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Du</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Yu</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Intelligent Microfluidics Research on Relative Permeability Measurement and Prediction of Two-phase Flow in Micropores[J]</article-title>. <source>Geofluids</source> <volume>2021</volume>, <fpage>1</fpage>&#x2013;<lpage>12</lpage>. <pub-id pub-id-type="doi">10.1155/2021/1194186</pub-id> </citation>
</ref>
<ref id="B27">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Song</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Ni</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Sun</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Zheng</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Kou</surname>
<given-names>J.</given-names>
</name>
<etal/>
</person-group> (<year>2021</year>). <article-title>Investigation on <italic>In-Situ</italic> Water Ice Recovery Considering Energy Efficiency at the Lunar South Pole</article-title>. <source>Appl. Energ.</source> <volume>298</volume>, <fpage>117136</fpage>. <pub-id pub-id-type="doi">10.1016/j.apenergy.2021.117136</pub-id> </citation>
</ref>
<ref id="B28">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Torrence</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Compo</surname>
<given-names>G. P.</given-names>
</name>
</person-group> (<year>1998</year>). <article-title>A Practical Guide to Wavelet Analysis</article-title>. <source>Bull. Amer. Meteorol. Soc.</source> <volume>79</volume>, <fpage>61</fpage>&#x2013;<lpage>78</lpage>. <pub-id pub-id-type="doi">10.1175/1520-0477(1998)079&#x3c;0061:apgtwa&#x3e;2.0.co;2</pub-id> </citation>
</ref>
<ref id="B29">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wang</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Song</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Rasouli</surname>
<given-names>V.</given-names>
</name>
<name>
<surname>Killough</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>An Integrated Approach for Gas-Water Relative Permeability Determination in Nanoscale Porous media</article-title>. <source>J. Pet. Sci. Eng.</source> <volume>173</volume>, <fpage>237</fpage>&#x2013;<lpage>245</lpage>. <pub-id pub-id-type="doi">10.1016/j.petrol.2018.10.017</pub-id> </citation>
</ref>
<ref id="B30">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wang</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Song</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Investigation on the Micro-flow Mechanism of Enhanced Oil Recovery by Low-Salinity Water Flooding in Carbonate Reservoir</article-title>. <source>Fuel</source> <volume>266</volume>, <fpage>117156</fpage>. <pub-id pub-id-type="doi">10.1016/j.fuel.2020.117156</pub-id> </citation>
</ref>
<ref id="B31">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Welbl</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2014</year>). &#x201c;<article-title>Casting Random Forests as Artificial Neural Networks (And Profiting from it)</article-title>,&#x201d; in <source>Pattern Recognition</source> (<publisher-name>Springer</publisher-name>), <fpage>765</fpage>&#x2013;<lpage>771</lpage>. <pub-id pub-id-type="doi">10.1007/978-3-319-11752-2_66</pub-id> </citation>
</ref>
<ref id="B32">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wyllie</surname>
<given-names>M. R. J.</given-names>
</name>
<name>
<surname>Gregory</surname>
<given-names>A. R.</given-names>
</name>
<name>
<surname>Gardner</surname>
<given-names>L. W.</given-names>
</name>
</person-group> (<year>1956</year>). <article-title>Elastic Wave Velocities in Heterogeneous and Porous Media</article-title>. <source>Geophysics</source> <volume>21</volume> (<issue>1</issue>), <fpage>41</fpage>&#x2013;<lpage>70</lpage>. <pub-id pub-id-type="doi">10.1190/1.1438217</pub-id> </citation>
</ref>
</ref-list>
</back>
</article>