<?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">1658516</article-id>
<article-id pub-id-type="doi">10.3389/feart.2025.1658516</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>Deep learning driven reconstruction of acoustic logging signal in energy exploration and development</article-title>
<alt-title alt-title-type="left-running-head">Wang et al.</alt-title>
<alt-title alt-title-type="right-running-head">
<ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3389/feart.2025.1658516">10.3389/feart.2025.1658516</ext-link>
</alt-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname>Wang</surname>
<given-names>Haiqing</given-names>
</name>
<uri xlink:href="https://loop.frontiersin.org/people/3120514/overview"/>
<role content-type="https://credit.niso.org/contributor-roles/data-curation/"/>
<role content-type="https://credit.niso.org/contributor-roles/conceptualization/"/>
<role content-type="https://credit.niso.org/contributor-roles/investigation/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-original-draft/"/>
<role content-type="https://credit.niso.org/contributor-roles/methodology/"/>
<role content-type="https://credit.niso.org/contributor-roles/Writing - review &#x26; editing/"/>
<role content-type="https://credit.niso.org/contributor-roles/formal-analysis/"/>
</contrib>
<contrib contrib-type="author" corresp="yes">
<name>
<surname>Zeng</surname>
<given-names>Yuting</given-names>
</name>
<xref ref-type="corresp" rid="c001">&#x2a;</xref>
<role content-type="https://credit.niso.org/contributor-roles/data-curation/"/>
<role content-type="https://credit.niso.org/contributor-roles/Writing - review &#x26; editing/"/>
<role content-type="https://credit.niso.org/contributor-roles/conceptualization/"/>
<role content-type="https://credit.niso.org/contributor-roles/formal-analysis/"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Li</surname>
<given-names>Jinyong</given-names>
</name>
<role content-type="https://credit.niso.org/contributor-roles/software/"/>
<role content-type="https://credit.niso.org/contributor-roles/investigation/"/>
<role content-type="https://credit.niso.org/contributor-roles/validation/"/>
<role content-type="https://credit.niso.org/contributor-roles/Writing - review &#x26; editing/"/>
<role content-type="https://credit.niso.org/contributor-roles/conceptualization/"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Tian</surname>
<given-names>Shuo</given-names>
</name>
<role content-type="https://credit.niso.org/contributor-roles/validation/"/>
<role content-type="https://credit.niso.org/contributor-roles/Writing - review &#x26; editing/"/>
<role content-type="https://credit.niso.org/contributor-roles/investigation/"/>
<role content-type="https://credit.niso.org/contributor-roles/software/"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Wang</surname>
<given-names>Yaqing</given-names>
</name>
<role content-type="https://credit.niso.org/contributor-roles/software/"/>
<role content-type="https://credit.niso.org/contributor-roles/investigation/"/>
<role content-type="https://credit.niso.org/contributor-roles/validation/"/>
<role content-type="https://credit.niso.org/contributor-roles/Writing - review &#x26; editing/"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Sun</surname>
<given-names>Xiaoyan</given-names>
</name>
<role content-type="https://credit.niso.org/contributor-roles/validation/"/>
<role content-type="https://credit.niso.org/contributor-roles/investigation/"/>
<role content-type="https://credit.niso.org/contributor-roles/software/"/>
<role content-type="https://credit.niso.org/contributor-roles/Writing - review &#x26; editing/"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Zhang</surname>
<given-names>Mingyong</given-names>
</name>
<role content-type="https://credit.niso.org/contributor-roles/validation/"/>
<role content-type="https://credit.niso.org/contributor-roles/Writing - review &#x26; editing/"/>
<role content-type="https://credit.niso.org/contributor-roles/investigation/"/>
<role content-type="https://credit.niso.org/contributor-roles/software/"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Liang</surname>
<given-names>Shiyue</given-names>
</name>
<role content-type="https://credit.niso.org/contributor-roles/software/"/>
<role content-type="https://credit.niso.org/contributor-roles/Writing - review &#x26; editing/"/>
<role content-type="https://credit.niso.org/contributor-roles/investigation/"/>
<role content-type="https://credit.niso.org/contributor-roles/validation/"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Li</surname>
<given-names>Ze</given-names>
</name>
<role content-type="https://credit.niso.org/contributor-roles/validation/"/>
<role content-type="https://credit.niso.org/contributor-roles/investigation/"/>
<role content-type="https://credit.niso.org/contributor-roles/Writing - review &#x26; editing/"/>
<role content-type="https://credit.niso.org/contributor-roles/software/"/>
</contrib>
</contrib-group>
<aff>
<institution>Shandong Leading Petro-Tech Co., Ltd.</institution>, <addr-line>Dongying</addr-line>, <addr-line>Shandong</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/2981669/overview">Juntao Liu</ext-link>, Lanzhou University, 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/2524921/overview">Weichen Zhan</ext-link>, The University of Texas at Austin, United States</p>
<p>
<ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/3052335/overview">Khaled Saleh</ext-link>, Cairo University, Egypt</p>
</fn>
<corresp id="c001">&#x2a;Correspondence: Yuting Zeng, <email>zengyuting@dylpt.com</email>
</corresp>
</author-notes>
<pub-date pub-type="epub">
<day>17</day>
<month>10</month>
<year>2025</year>
</pub-date>
<pub-date pub-type="collection">
<year>2025</year>
</pub-date>
<volume>13</volume>
<elocation-id>1658516</elocation-id>
<history>
<date date-type="received">
<day>02</day>
<month>07</month>
<year>2025</year>
</date>
<date date-type="accepted">
<day>29</day>
<month>09</month>
<year>2025</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#xa9; 2025 Wang, Zeng, Li, Tian, Wang, Sun, Zhang, Liang and Li.</copyright-statement>
<copyright-year>2025</copyright-year>
<copyright-holder>Wang, Zeng, Li, Tian, Wang, Sun, Zhang, Liang and Li</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>In oil and gas exploration and development, logging curves are the key data for obtaining underground geological information. However, in actual acquisition processes, problems such as drilling fluid invasion and wellbore collapse often lead to the absence or distortion of logging data, thereby affecting their subsequent analysis and application. Well logging curves exhibit clear context-dependent characteristics. Traditional reconstruction methods are mostly based on the assumption of independent and identically distributed data and are difficult to capture the temporal dependencies between data, resulting in limited accuracy of time series modeling. Therefore, for the shale reservoir in a certain basin in the northeastern region, this paper introduces a method that combines variational mode decomposition (VMD), convolutional neural network (CNN), and bidirectional long short-term memory neural network (BiLSTM) to achieve high-precision reconstruction of logging acoustic wave signals (DT). The VMD method decomposes the logging curves into different mode functions (IMF), achieving the extraction of features at different scales; the CNN method is used to extract local features such as local morphology and change trends of IMF, obtaining high-level feature representations; the BiLSTM is used to extract the bidirectional long-term dependencies of features. By standardizing the logging data, to avoid the subjectivity of manually selecting the input logging curves, the XGBoost-SHAP method is introduced to optimize the logging curves, and an DT-targeted gradient boosting regression model is constructed using XGBoost, and the SHAP values are used to conduct game theory-based contribution analysis for each input feature, obtaining the feature ranking based on the cumulative SHAP contribution. Finally, three sensitive curves, CNL, GR, and RS, are selected as input features to construct the VMD-CNN-BiLSTM prediction model, which is applied to two test wells, achieving a fitting goodness (R<sup>2</sup>) of 0.71 and 0.88 respectively. Further comparative experiments have shown that the VMD-CNN-BiLSTM model has significantly improved performance in terms of MSE, MAE, MAPE, R<sup>2</sup>, etc., compared to the SVR, random forest, and LSTM methods. The MSE has increased by 20.5&#x2013;33.9, MAE by 1.5&#x2013;2.1, MAPE by 1.6%&#x2013;2.3%, and R<sup>2</sup> by 0.21&#x2013;0.36.</p>
</abstract>
<kwd-group>
<kwd>variational mode decomposition</kwd>
<kwd>convolutional neural networks</kwd>
<kwd>logging curvereconstruction</kwd>
<kwd>long short-term memory neural network</kwd>
<kwd>acoustic signal</kwd>
</kwd-group>
<custom-meta-wrap>
<custom-meta>
<meta-name>section-at-acceptance</meta-name>
<meta-value>Solid Earth Geophysics</meta-value>
</custom-meta>
</custom-meta-wrap>
</article-meta>
</front>
<body>
<sec sec-type="intro" id="s1">
<title>1 Introduction</title>
<p>In petroleum exploration, logging curves constitute essential geological data that facilitate for-mation evaluation through lithology interpretation, reservoir parameter determination, and seismic inversion processes. Among them, the acoustic logging curves directly reflect the coupling effect of the elastic modulus of the rock matrix and the compressibility of the pore fluids by recording the propagation time of the longitudinal waves in the formation. They are mainly used in synthetic seismic records, lithology discrimination, porosity calculation, and rock mechanics parameter calculation. In the actual logging process, interference from unfavorable factors such as borehole collapse and instrument failure can lead to problems such as missing data and distortion of logging curves (<xref ref-type="bibr" rid="B23">Wang et al., 2020</xref>), which increases the difficulty of subsequent geological work. In view of the high cost of re-logging, engineering difficulty and other problems (<xref ref-type="bibr" rid="B34">Zhou et al., 2022</xref>), how to carry out logging curve re-construction has become a key link in the exploration and development of oil and gas reservoirs.</p>
<p>To solve this problem, early researchers mainly used traditional methods for curve reconstruc-tion, such as empirical formulas (<xref ref-type="bibr" rid="B3">Chen and Wang, 2005</xref>; <xref ref-type="bibr" rid="B28">Yuan et al., 2009</xref>), petrophysical modeling (<xref ref-type="bibr" rid="B12">Li et al., 2016</xref>; <xref ref-type="bibr" rid="B33">Zhao et al., 2016</xref>), and multiple regression (<xref ref-type="bibr" rid="B27">Yin et al., 2014</xref>; <xref ref-type="bibr" rid="B14">Liao, 2014</xref>; <xref ref-type="bibr" rid="B22">Wang et al., 2016</xref>). However, in complex geological formations, logging curves often exhibit intricate nonlinear correla-tions. Conventional methods fail to adequately characterize these relationships, leading to poor re-construction accuracy that falls short of practical application standards.</p>
<p>With the development and application of machine learning, relevant algorithms have been widely used in the petroleum field. Machine learning algorithms such as K nearest neighbor (<xref ref-type="bibr" rid="B2">Aftab et al., 2023</xref>), support vector machine, random forest (<xref ref-type="bibr" rid="B8">Ibrahim and Elkatatny, 2022</xref>), and XGBoost (<xref ref-type="bibr" rid="B31">Zhang et al., 2022</xref>) have been widely used in relevant research. These algorithms are able to mine the complex nonlinear relationship between data, which improves the reconstruction accuracy to a certain extent. However, the &#x201c;point-by-point prediction&#x201d; paradigm has a fundamental flaw: they treat time series as independent and identically distributed observation points, thereby destroying the inherent temporal continuity. For instance, KNN only relies on numerical similarity and ignores the context order, making it prone to finding incorrect historical similar points; Random Forest, through bootstrap sampling and random feature selection, disrupts the temporal order, and its model structure cannot jointly maintain or remember long-term temporal states. Therefore, these methods are difficult to systematically capture time dependence (<xref ref-type="bibr" rid="B35">Zhou et al., 2025</xref>).</p>
<p>Deep learning, as an important branch of machine learning, provides a new solution for the re-construction of logging curves (<xref ref-type="bibr" rid="B30">Zhan et al., 2024</xref>; <xref ref-type="bibr" rid="B15">Liu D. et al., 2024</xref>). Deep learning models represented by convolutional neural network (CNN) (<xref ref-type="bibr" rid="B29">Zhai et al., 2023</xref>; <xref ref-type="bibr" rid="B6">Gama et al., 2025</xref>; <xref ref-type="bibr" rid="B13">Li et al., 2023</xref>) and recurrent neural network (RNN, LSTM) (<xref ref-type="bibr" rid="B32">Zhang et al., 2024</xref>; <xref ref-type="bibr" rid="B16">Liu J. et al., 2024</xref>; <xref ref-type="bibr" rid="B21">Shang et al., 2022</xref>) have been widely introduced into this field. CNN can effectively extract the spatial features of the logging data and explore the correla-tion between different parameters; RNN and its variants are good at dealing with the time-series da-ta and capture the information of the logging curve changes with depth, which is suitable for the re-construction of logging curve.</p>
<p>We make the following key contributions in this paper:<list list-type="simple">
<list-item>
<p>1. We employed the XGBoost-SHAP method for interpretability-based feature selection. This method is capable of effectively extracting the nonlinear relationships between the feature variables and the target variable, and can also explore the influence of multi-variable interaction effects on the prediction outcome.</p>
</list-item>
<list-item>
<p>2. We employed a combined loss function that integrates the soft dynamic time warping loss (Soft-DTW) and the mean square error loss (MSE). The Soft-DTW is used to measure the global similarity of the predicted curve and the actual curve, while the MSE is used to measure the single-point error. The combination of these two losses is utilized to better balance the scatter error of the well logging curve points and the overall trend error.</p>
</list-item>
<list-item>
<p>3. We utilize VMD to decompose the input and target curves into multi-frequency components, build CNN-BiLSTM models for each component, and superimpose the predicted components to reconstruct the final curve.</p>
</list-item>
</list>
</p>
<p>The rest of the paper is organized as follows: <xref ref-type="sec" rid="s2">Section 2</xref> summarizes the previous work. <xref ref-type="sec" rid="s3">Section 3</xref> explains the principles of the algorithms involved. <xref ref-type="sec" rid="s4">Section 4</xref> involved data preprocessing, feature selection, sample construction, model training, application effect analysis, and comparison experiments. <xref ref-type="sec" rid="s5">Section 5</xref> concludes the work of this paper.</p>
</sec>
<sec id="s2">
<title>2 Related works</title>
<p>As fundamental datasets for subsurface characterization, the quality (completeness and preci-sion) of well logging curves directly impacts the reliability of reservoir assessment. Traditional em-pirical formulas and petrophysical modeling methods can make preliminary estimation of the curve based on statistical laws, but there are obvious limitations in reconstruction accuracy in the face of the nonlinear relationship between logging data and its obvious spatial sequence characteristics under complex geological conditions.</p>
<p>The application of machine learning algorithms brings a new technical path for logging curve reconstruction. <xref ref-type="bibr" rid="B10">Kim and Cho (2024)</xref> applied a K-nearest neighbor collaborative filtering interpolation method for missing logging completion in a district in Norway, which demonstrated that the collab-orative filtering method, which is mainly applied to recommender system, can be better used for the interpolation of missing well logging data. <xref ref-type="bibr" rid="B31">Zhang et al. (2022)</xref> found through comparative experiments that the XGBoost algorithm has better accuracy and stability in the task of logging curve reconstruc-tion, showing stronger generalization ability. <xref ref-type="bibr" rid="B11">Li and Jiang (2025)</xref> further analyzed the XGBoost-based acoustic logging curve reconstruction in combination with the SHAP algorithm, confirming that fea-ture importance is crucial for model prediction accuracy. <xref ref-type="bibr" rid="B1">Afifi and Anifowose (2023)</xref> investigated the effectiveness of artificial neural networks, regression trees, support vector machines, and random forests in predicting acoustic wave curves. Among them, random forests had the lowest error rate, and through different feature combinations, it was confirmed that only using cable logging data was sufficient to achieve high-precision predictions. <xref ref-type="bibr" rid="B17">Nero et al. (2023)</xref> employed the support vector machine (SVM), random forest (RF), and extreme gradient boosting (XGBoost) algorithms to predict the acoustic wave curves of the Tano basin of Ghana, and confirmed that the generalization ability of the integrated machine learning algorithms is superior to that of the non-integrated learning algorithms. <xref ref-type="bibr" rid="B20">Saleh et al. (2025)</xref> examined the effectiveness of six machine learning algorithms, including random forest, in predicting acoustic logging curves. They concluded that the accuracy of ensemble models such as random forest and XGBoost was the highest. Additionally, they emphasized that feature engineering is crucial for enhancing the performance of the models. Due to their architectural limitations, tradi-tional machine learning methods often fail to effectively model long-term temporal dependencies in datasets.</p>
<p>The rise of deep learning has revolutionized the new paradigm of logging curve reconstruction. <xref ref-type="bibr" rid="B29">Zhai et al. (2023)</xref> used a two-dimensional convolutional neural network (CNN) and introduced an at-tention mechanism to strengthen the deep learning network&#x2019;s ability to capture the autocorrelation and inter-correlation feature information of logging curves, and verified the reconstruction results with high accuracy through synthetic seismic records. <xref ref-type="bibr" rid="B32">Zhang et al. (2024)</xref> used a two-way long-short-term network method optimized by a particle swarm algorithm for the reconstruction of The particle swarm method obtains reasonable hyperparameters for the network and reduces the uncertainty of manual parameter adjustment, and the model has the ability of dynamic optimization and adaptive reconstruction in the process of logging reconstruction, which is applied to Qinshui Ba-sin with good results. <xref ref-type="bibr" rid="B18">Qu et al. (2025)</xref> proposed an interpolation method based on generative adver-sarial network algorithm for the problem of incomplete logging data. The application results show that the proposed method can effectively extract spatio-temporal features and correlations from log-ging data, and has stable interpolation capability for logging data with different missing rates and missing locations.</p>
<p>This study proposes a novel hybrid VMD-CNN-BiLSTM model for acoustic time-series (DT) re-construction, with experimental results demonstrating its superior performance.</p>
</sec>
<sec id="s3">
<title>3 Deep learning method for well logging acoustic signal reconstruction</title>
<sec id="s3-1">
<title>3.1 Variational modal decomposition (VMD)</title>
<p>Variational Mode Decomposition (VMD) was proposed by <xref ref-type="bibr" rid="B5">Dragomiretskiy and Zosso (2013)</xref>. It is an adaptive signal processing method. Different from traditional signal processing methods based on Fourier transform or wavelet transform, VMD decomposes complex multi-component signals into multiple Intrinsic Mode Functions (IMFs) with different central frequencies. These IMFs have specific physical meanings and excellent properties, enabling the effective extraction of features from different frequency components in the signal. As a result, VMD has been widely applied in the field of signal processing. The VMD method seeks a set of mode functions through variational optimization. Its objective function aims to minimize the sum of the bandwidths of all IMFs, with the constraint that the sum of all IMFs is equal to the original signal. The formula is shown in <xref ref-type="disp-formula" rid="e1">Equations 1</xref>, <xref ref-type="disp-formula" rid="e2">2</xref>:<disp-formula id="e1">
<mml:math id="m1">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="italic">f</mml:mi>
<mml:mi mathvariant="italic">min</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:munder>
<mml:mi mathvariant="italic">min</mml:mi>
<mml:mrow>
<mml:mrow>
<mml:mfenced open="{" close="}" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="italic">u</mml:mi>
<mml:mi mathvariant="italic">k</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>,</mml:mo>
<mml:mrow>
<mml:mfenced open="{" close="}" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="italic">&#x3c9;</mml:mi>
<mml:mi mathvariant="italic">k</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:munder>
<mml:mrow>
<mml:mfenced open="{" close="}" separators="|">
<mml:mrow>
<mml:mstyle displaystyle="true">
<mml:munder>
<mml:mo>&#x2211;</mml:mo>
<mml:mi mathvariant="italic">k</mml:mi>
</mml:munder>
</mml:mstyle>
<mml:mrow>
<mml:msubsup>
<mml:mrow>
<mml:mfenced open="|" close="|" separators="|">
<mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">&#x2202;</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi mathvariant="italic">t</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi mathvariant="italic">&#x3b4;</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi mathvariant="bold-italic">t</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2b;</mml:mo>
<mml:mfrac>
<mml:mi mathvariant="italic">j</mml:mi>
<mml:mrow>
<mml:mi mathvariant="italic">&#x3c0;</mml:mi>
<mml:mi mathvariant="italic">t</mml:mi>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2a;</mml:mo>
<mml:msub>
<mml:mi mathvariant="italic">u</mml:mi>
<mml:mi mathvariant="italic">k</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi mathvariant="italic">t</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:msup>
<mml:mi mathvariant="italic">e</mml:mi>
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mi mathvariant="italic">j</mml:mi>
<mml:msub>
<mml:mi mathvariant="italic">&#x3c9;</mml:mi>
<mml:mi mathvariant="italic">k</mml:mi>
</mml:msub>
<mml:mi mathvariant="italic">t</mml:mi>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mn>2</mml:mn>
<mml:mn>2</mml:mn>
</mml:msubsup>
</mml:mrow>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(1)</label>
</disp-formula>
<disp-formula id="e2">
<mml:math id="m2">
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mo>.</mml:mo>
<mml:mi>t</mml:mi>
<mml:mtext>&#x2009;</mml:mtext>
<mml:mrow>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi mathvariant="italic">k</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi mathvariant="italic">K</mml:mi>
</mml:munderover>
</mml:mstyle>
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="italic">u</mml:mi>
<mml:mi mathvariant="italic">k</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mi mathvariant="italic">f</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi mathvariant="italic">t</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(2)</label>
</disp-formula>
</p>
<p>Where <inline-formula id="inf1">
<mml:math id="m3">
<mml:mrow>
<mml:mi mathvariant="normal">&#x3b4;</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> is the Dirac function, &#x2217; denotes the convolution operation, <inline-formula id="inf2">
<mml:math id="m4">
<mml:mrow>
<mml:mi>&#x2202;</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> denotes the derivative with respect to time, <italic>j</italic> is the imaginary unit, and <inline-formula id="inf3">
<mml:math id="m5">
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> is the original signal, decomposed into <italic>k</italic> modal functions <inline-formula id="inf4">
<mml:math id="m6">
<mml:mrow>
<mml:msub>
<mml:mi>u</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>, each of which corresponding to a center frequency <inline-formula id="inf5">
<mml:math id="m7">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3c9;</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>.</p>
<p>In this study, the VMD method is used to decompose the logging curve data into sub-series with different frequencies, which respond to the overall trend, and local change characteristics of the logging curve. The high complexity and strong nonlinear characteristics of this time series can be solved by this processing.</p>
</sec>
<sec id="s3-2">
<title>3.2 Convolutional neural network (CNN)</title>
<p>Convolutional Neural Networks (CNNs) represent a class of deep neural networks characterized by their convolutional operations, originally developed for and predominantly applied in computer vision tasks. The core idea of CNN is to utilize convolutional operation to achieve the extraction of local features (e.g., edges, textures). Through the stacking of multiple convolutional layers, CNN can gradually abstract from low-level features to high-level semantic features, realizing the hierarchical expression of data features. Compared with the traditional fully connected neural network, CNN significantly reduces the number of model parameters through the weight sharing strategy and effectively avoids the overfitting problem (<xref ref-type="bibr" rid="B24">Wu et al., 2024</xref>). In this study, the well logging curves are presented in a 1D sequence format, where each data point corresponds to a specific depth. The local correlation between adjacent depth points (such as the sudden signal change at the interface between sandstone and mudstone) directly reflects the subtle geological changes. The 1D-CNN is designed to scan the 1D well logging sequence using a 1D convolution kernel, thereby capturing local spatial features. This method is directly similar to the way two-dimensional convolutional neural networks capture textures and edges in images.</p>
<p>The core component of CNN is the convolutional layer, which generates feature maps through convolution operations (<xref ref-type="fig" rid="F1">Figure 1</xref>). The input data passes through the convolution kernel, and the mathematical expression is shown in <xref ref-type="disp-formula" rid="e3">Equation 3</xref>:<disp-formula id="e3">
<mml:math id="m8">
<mml:mrow>
<mml:mi mathvariant="italic">Y</mml:mi>
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi mathvariant="italic">m</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>0</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">M</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:munderover>
</mml:mstyle>
<mml:mrow>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi mathvariant="italic">n</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>0</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">N</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:munderover>
</mml:mstyle>
<mml:mrow>
<mml:mi mathvariant="italic">X</mml:mi>
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mi mathvariant="italic">m</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi mathvariant="italic">j</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mi mathvariant="italic">n</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mrow>
</mml:mrow>
<mml:mo>&#xb7;</mml:mo>
<mml:mi mathvariant="italic">W</mml:mi>
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:mi mathvariant="italic">m</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi mathvariant="italic">n</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2b;</mml:mo>
<mml:mi mathvariant="italic">b</mml:mi>
</mml:mrow>
</mml:math>
<label>(3)</label>
</disp-formula>
</p>
<fig id="F1" position="float">
<label>FIGURE 1</label>
<caption>
<p>Schematic of 1D convolutional computation.</p>
</caption>
<graphic xlink:href="feart-13-1658516-g001.tif">
<alt-text content-type="machine-generated">Three isometric arrays are shown in a sequence connected by red lines. The first array contains the sequence '100', the second '101', and the final array contains only '1'. The arrays are outlined in blue.</alt-text>
</graphic>
</fig>
<p>Where <italic>M &#xd7; N</italic> denotes the convolution kernel size, <italic>W</italic> is the weight, and <italic>b</italic> is the bias term.</p>
<p>A conventional CNN framework typically comprises three fundamental components: (1) an input layer for raw image data reception, (2) a convolutional module containing sequentially arranged convolutional operations, nonlinear activation units, and downsampling layers for hierarchical feature extraction and dimensional reduction, and (3) a fully-connected classifier for final feature-to-label transformation.</p>
</sec>
<sec id="s3-3">
<title>3.3 Long short-term memory network (LSTM)</title>
<p>Long Short-Term Memory network (LSTM) is a special kind of Recurrent Neural Network (RNN) proposed by <xref ref-type="bibr" rid="B7">Hochreiter and Schmidhuber (1997)</xref>, the core of which is to solve the problem of gradient vanishing and explosion encountered by RNN when dealing with long sequence data. Long Short-Term Memory (LSTM) networks are suitable for processing temporal data and are widely used in speech processing and natural language processing. LSTM controls the flow of information through three gate structures: forgetting gate, memorizing gate, and output gate (<xref ref-type="fig" rid="F2">Figure 2</xref>).</p>
<fig id="F2" position="float">
<label>FIGURE 2</label>
<caption>
<p>Structural diagram of the neural network for long short-term memory.</p>
</caption>
<graphic xlink:href="feart-13-1658516-g002.tif">
<alt-text content-type="machine-generated">Diagram of a Gated Recurrent Unit (GRU) architecture showing connections and operations. It consists of three blocks with sigmoid (&#x3C3;) and hyperbolic tangent (tanh) functions for processing input (\( x_t \)) and hidden states (\( h_t \)), illustrating the data flow through internal gates.</alt-text>
</graphic>
</fig>
<p>Oblivion Gate: selectively forgets historical information about the input. This component receives the information <inline-formula id="inf6">
<mml:math id="m9">
<mml:mrow>
<mml:msub>
<mml:mi>h</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> of the previous time state and the current input <inline-formula id="inf7">
<mml:math id="m10">
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, expressed as the formula is shown in <xref ref-type="disp-formula" rid="e4">Equation 4</xref>:<disp-formula id="e4">
<mml:math id="m11">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="italic">f</mml:mi>
<mml:mi mathvariant="italic">t</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mi mathvariant="italic">&#x3c3;</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="italic">W</mml:mi>
<mml:mi mathvariant="italic">f</mml:mi>
</mml:msub>
<mml:mo>&#xb7;</mml:mo>
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="italic">h</mml:mi>
<mml:mrow>
<mml:mi mathvariant="italic">t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi mathvariant="italic">x</mml:mi>
<mml:mi mathvariant="italic">t</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi mathvariant="italic">b</mml:mi>
<mml:mi mathvariant="italic">f</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(4)</label>
</disp-formula>
</p>
<p>Where <inline-formula id="inf8">
<mml:math id="m12">
<mml:mrow>
<mml:msub>
<mml:mi>f</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the output information of the forgetting gate, <inline-formula id="inf9">
<mml:math id="m13">
<mml:mrow>
<mml:mi>&#x3c3;</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> is the activation function, <inline-formula id="inf10">
<mml:math id="m14">
<mml:mrow>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mi>f</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the weight, and <inline-formula id="inf11">
<mml:math id="m15">
<mml:mrow>
<mml:msub>
<mml:mi>b</mml:mi>
<mml:mi>f</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the bias.</p>
<p>Input Gate: Controls the addition of current input information to the memory cell. The update of the information in the memory cell and the generation of a new memory value is controlled by an activation function, expressed by the formula is shown in <xref ref-type="disp-formula" rid="e5">Equations 5</xref>, <xref ref-type="disp-formula" rid="e6">6</xref>:<disp-formula id="e5">
<mml:math id="m16">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mi mathvariant="italic">t</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mi mathvariant="italic">&#x3c3;</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="italic">W</mml:mi>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:msub>
<mml:mo>&#xb7;</mml:mo>
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="italic">h</mml:mi>
<mml:mrow>
<mml:mi mathvariant="italic">t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi mathvariant="italic">x</mml:mi>
<mml:mi mathvariant="italic">t</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi mathvariant="italic">b</mml:mi>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(5)</label>
</disp-formula>
<disp-formula id="e6">
<mml:math id="m17">
<mml:mrow>
<mml:mover accent="true">
<mml:msub>
<mml:mi mathvariant="italic">C</mml:mi>
<mml:mi mathvariant="italic">t</mml:mi>
</mml:msub>
<mml:mo>&#x223c;</mml:mo>
</mml:mover>
<mml:mo>&#x3d;</mml:mo>
<mml:mi mathvariant="italic">tanh</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="italic">W</mml:mi>
<mml:mi mathvariant="italic">C</mml:mi>
</mml:msub>
<mml:mo>&#xb7;</mml:mo>
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="italic">h</mml:mi>
<mml:mrow>
<mml:mi mathvariant="italic">t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi mathvariant="italic">x</mml:mi>
<mml:mi mathvariant="italic">t</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi mathvariant="italic">b</mml:mi>
<mml:mi mathvariant="italic">C</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(6)</label>
</disp-formula>
</p>
<p>Where <inline-formula id="inf12">
<mml:math id="m18">
<mml:mrow>
<mml:msub>
<mml:mi>i</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the output of the input gate, <inline-formula id="inf13">
<mml:math id="m19">
<mml:mrow>
<mml:mover accent="true">
<mml:msub>
<mml:mi>C</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
<mml:mo>&#x223c;</mml:mo>
</mml:mover>
</mml:mrow>
</mml:math>
</inline-formula> is the candidate memory value at the current moment, and <inline-formula id="inf14">
<mml:math id="m20">
<mml:mrow>
<mml:mi mathvariant="italic">tanh</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> is the activation function.</p>
<p>Output gate: the output gate selectively filters the composite information derived from both the memory cell state and current input features, thereby determining the final output representation and generating an updated hidden state through a gating mechanism, which is expressed by <xref ref-type="disp-formula" rid="e7">Equations 7</xref>, <xref ref-type="disp-formula" rid="e8">8</xref>:<disp-formula id="e7">
<mml:math id="m21">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="italic">o</mml:mi>
<mml:mi mathvariant="italic">t</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mi mathvariant="italic">&#x3c3;</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="italic">W</mml:mi>
<mml:mi mathvariant="italic">o</mml:mi>
</mml:msub>
<mml:mo>&#xb7;</mml:mo>
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="italic">h</mml:mi>
<mml:mrow>
<mml:mi mathvariant="italic">t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi mathvariant="italic">x</mml:mi>
<mml:mi mathvariant="italic">t</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi mathvariant="italic">b</mml:mi>
<mml:mi mathvariant="italic">o</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(7)</label>
</disp-formula>
<disp-formula id="e8">
<mml:math id="m22">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="italic">h</mml:mi>
<mml:mi mathvariant="italic">t</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mi mathvariant="italic">o</mml:mi>
<mml:mi mathvariant="italic">t</mml:mi>
</mml:msub>
<mml:mo>&#xb7;</mml:mo>
<mml:mo>&#x2061;</mml:mo>
<mml:mi mathvariant="italic">tanh</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="italic">C</mml:mi>
<mml:mi mathvariant="italic">t</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(8)</label>
</disp-formula>
</p>
<p>Where <inline-formula id="inf15">
<mml:math id="m23">
<mml:mrow>
<mml:msub>
<mml:mi>o</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the output of the output gate and <inline-formula id="inf16">
<mml:math id="m24">
<mml:mrow>
<mml:msub>
<mml:mi>h</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is the hidden state at the current moment.</p>
<p>Memory updating: the memory cell state undergoes dynamic updating through the coordinated operation of both input and forget gates, which collectively regulate the incorporation of new information and the retention of historical context, which is expressed by <xref ref-type="disp-formula" rid="e9">Equation 9</xref>:<disp-formula id="e9">
<mml:math id="m25">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="italic">C</mml:mi>
<mml:mi mathvariant="italic">t</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mi mathvariant="italic">f</mml:mi>
<mml:mi mathvariant="italic">t</mml:mi>
</mml:msub>
<mml:mo>&#xb7;</mml:mo>
<mml:msub>
<mml:mi mathvariant="italic">C</mml:mi>
<mml:mrow>
<mml:mi mathvariant="italic">t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mi mathvariant="italic">t</mml:mi>
</mml:msub>
<mml:mo>&#xb7;</mml:mo>
<mml:mover accent="true">
<mml:msub>
<mml:mi mathvariant="italic">C</mml:mi>
<mml:mi mathvariant="italic">t</mml:mi>
</mml:msub>
<mml:mo>&#x223c;</mml:mo>
</mml:mover>
</mml:mrow>
</mml:math>
<label>(9)</label>
</disp-formula>
</p>
<p>In this study, the LSTM&#x2019;s ability to preserve depth-dependent dependencies allows it to model geological transitions that are not apparent from shallow features alone.</p>
</sec>
<sec id="s3-4">
<title>3.4 VMD-CNN-BiLSTM model structure</title>
<p>The CNN-BiLSTM model combines the advantages of convolutional neural network (CNN) and bi-directional long short-term memory network (BiLSTM) (<xref ref-type="bibr" rid="B19">Redwan et al., 2025</xref>). The hybrid architecture leverages complementary strengths: CNN demonstrates superior capability in extracting localized temporal patterns, while the bidirectional LSTM (BiLSTM) effectively captures long-range dependencies through its dual-directional processing, enabling comprehensive utilization of inter-strata contextual information.</p>
<p>In this paper, a VMD-CNN-BiLSTM cascade model is constructed by combining VMD, CNN, and BiLSTM, and the model structure is shown in <xref ref-type="fig" rid="F3">Figure 3</xref>. Each VMD component is independently fed into a CNN-BiLSTM model, whose output is a subcomponent of the final DT curve; these are then summed to reconstruct the complete acoustic profile. Specifically, the VMD method is used to decompose different logging curves into multiple secondary curves with different frequencies, and construct the prediction model of logging curves with different frequencies, for each model, firstly, the secondary logging curves of the frequency are used as the input of CNN, and after feature extraction of the local features by CNN, BiLSTM receives the sequences processed by CNN, and extracts the before-and-after correlation information of the logging data, and then, the BiLSTM processed features are input to a fully connected layer to map to the secondary acoustic curve of the same frequency, and finally, the secondary acoustic curves obtained from each model are superimposed to obtain the final acoustic reconstruction curve.</p>
<fig id="F3" position="float">
<label>FIGURE 3</label>
<caption>
<p>Architecture of VMD-CNN-BiLSTM model.</p>
</caption>
<graphic xlink:href="feart-13-1658516-g003.tif">
<alt-text content-type="machine-generated">Flowchart illustrating a data processing model. It shows three sets of input signals labeled IMF1, IMF2, and IMF3. Each set goes through a Convolutional Neural Network (CNN) block, followed by a Bidirectional Long Short-Term Memory (BiLSTM) layer, and ends with a Dense layer. The process combines outputs into a single blue waveform. Arrows indicate data flow direction.</alt-text>
</graphic>
</fig>
</sec>
<sec id="s3-5">
<title>3.5 Loss function</title>
<p>In this study, a composite loss function combining mean square error (MSE) and soft dynamic time regularization loss (Soft-DTW) (<xref ref-type="bibr" rid="B4">Cuturi and Blondel, 2017</xref>; <xref ref-type="bibr" rid="B9">Jiang et al., 2022</xref>) is used to balance the optimization objective of local point-by-point error and global morphological similarity in time series forecasting. The traditional MSE loss is sensitive to point-by-point errors, but it is difficult to capture the overall trends and interrelationships of the sequences; Soft-DTW introduces a differentiable approximation to the classical dynamic time warping algorithm through continuous relaxation of alignment paths, thereby enabling direct integration with neural network training frameworks that traditional DTW cannot support due to its non-differentiable nature.</p>
<p>The mean square error (MSE) represents a fundamental loss metric in regression analysis, quantifying the expected squared deviation between predicted and observed values across temporal data points. The formula is shown in <xref ref-type="disp-formula" rid="e10">Equation 10</xref>:<disp-formula id="e10">
<mml:math id="m26">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="italic">L</mml:mi>
<mml:mrow>
<mml:mi mathvariant="italic">M</mml:mi>
<mml:mi mathvariant="italic">S</mml:mi>
<mml:mi mathvariant="italic">E</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">N</mml:mi>
</mml:mrow>
</mml:mfrac>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi mathvariant="italic">N</mml:mi>
</mml:munderover>
</mml:mstyle>
<mml:msup>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mover accent="true">
<mml:msub>
<mml:mi mathvariant="italic">y</mml:mi>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:msub>
<mml:mo>&#x5e;</mml:mo>
</mml:mover>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi mathvariant="italic">y</mml:mi>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:msup>
</mml:mrow>
</mml:math>
<label>(10)</label>
</disp-formula>
</p>
<p>Where <inline-formula id="inf17">
<mml:math id="m27">
<mml:mrow>
<mml:mover accent="true">
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x5e;</mml:mo>
</mml:mover>
</mml:mrow>
</mml:math>
</inline-formula> is the predicted value of the ith data point, <inline-formula id="inf18">
<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 corresponding true value, and <italic>N</italic> is the total number of data points.</p>
<p>While MSE offers computational advantages including straightforward gradient computation and stable optimization convergence, its underlying assumption of temporal independence limits its ability to capture sequential dependencies and global morphological patterns in time-series data.</p>
<p>Soft Dynamic Time Regularization Loss (Soft-DTW), on the other hand, is an improvement of traditional DTW, aiming at solving its problem of non-trivial discrete path search. The conventional DTW algorithm employs dynamic programming to identify the optimal nonlinear alignment path between temporal sequences, providing an effective measure of global morphological similarity. However, its discrete optimization nature precludes direct integration with neural network architectures for end-to-end learning. Soft-DTW transforms the discrete path selection into continuous probability distributions based on the softmax function through the introduction of the smoothing relaxation technique, making the loss function microscopic. Specifically, a similarity matrix M is constructed between the predicted sequence and the actual sequence, as shown in <xref ref-type="disp-formula" rid="e11">Equation 11</xref>:<disp-formula id="e11">
<mml:math id="m29">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="italic">M</mml:mi>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mfenced open="|" close="" separators="|">
<mml:mrow>
<mml:mrow>
<mml:mover accent="true">
<mml:msub>
<mml:mi mathvariant="italic">Y</mml:mi>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:msub>
<mml:mo>&#x5e;</mml:mo>
</mml:mover>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi mathvariant="italic">Y</mml:mi>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:msubsup>
<mml:mo>&#x7c;</mml:mo>
<mml:mn>2</mml:mn>
<mml:mn>2</mml:mn>
</mml:msubsup>
</mml:mrow>
</mml:math>
<label>(11)</label>
</disp-formula>
</p>
<p>Where <inline-formula id="inf19">
<mml:math id="m30">
<mml:mrow>
<mml:msub>
<mml:mi>M</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> denotes the squared Euclidean distance for the ith and jth data points.</p>
<p>The accumulation matrix A is then computed by dynamic programming, as shown in <xref ref-type="disp-formula" rid="e12">Equation 12</xref>:<disp-formula id="e12">
<mml:math id="m31">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="italic">A</mml:mi>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mi mathvariant="italic">M</mml:mi>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:mi mathvariant="italic">log</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi mathvariant="italic">exp</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="italic">A</mml:mi>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi mathvariant="italic">j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2b;</mml:mo>
<mml:mi mathvariant="italic">exp</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="italic">A</mml:mi>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi mathvariant="italic">j</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2b;</mml:mo>
<mml:mi mathvariant="italic">exp</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="italic">A</mml:mi>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi mathvariant="italic">j</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(12)</label>
</disp-formula>
</p>
<p>Where each element <inline-formula id="inf20">
<mml:math id="m32">
<mml:mrow>
<mml:msub>
<mml:mi>A</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> represents a smooth approximation of the minimum cumulative distance from the starting point (1,1) to (i,j).</p>
<p>The final Soft-DTW loss is the normalized value of the element <inline-formula id="inf21">
<mml:math id="m33">
<mml:mrow>
<mml:msub>
<mml:mi>A</mml:mi>
<mml:mrow>
<mml:mi>T</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>T</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> in the lower right corner of the accumulation matrix, where <italic>T</italic> is the length of the sequence. This loss function is insensitive to the time axis offset and can effectively capture the global characteristics of the sequence such as trend and period.</p>
<p>The MSE is finally combined with Soft-DTW to construct the composite loss function, as shown in <xref ref-type="disp-formula" rid="e13">Equation 13</xref>:<disp-formula id="e13">
<mml:math id="m34">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="italic">L</mml:mi>
<mml:mrow>
<mml:mi mathvariant="italic">t</mml:mi>
<mml:mi mathvariant="italic">o</mml:mi>
<mml:mi mathvariant="italic">t</mml:mi>
<mml:mi mathvariant="italic">a</mml:mi>
<mml:mi mathvariant="italic">l</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mi mathvariant="italic">&#x3bb;</mml:mi>
<mml:msub>
<mml:mi mathvariant="italic">L</mml:mi>
<mml:mrow>
<mml:mi mathvariant="italic">M</mml:mi>
<mml:mi mathvariant="italic">S</mml:mi>
<mml:mi mathvariant="italic">E</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:mi mathvariant="italic">&#x3bb;</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#xb7;</mml:mo>
<mml:msub>
<mml:mi mathvariant="italic">L</mml:mi>
<mml:mrow>
<mml:mi mathvariant="italic">S</mml:mi>
<mml:mi mathvariant="italic">o</mml:mi>
<mml:mi mathvariant="italic">f</mml:mi>
<mml:mi mathvariant="italic">t</mml:mi>
<mml:mo>&#x2010;</mml:mo>
<mml:mi mathvariant="italic">D</mml:mi>
<mml:mi mathvariant="italic">T</mml:mi>
<mml:mi mathvariant="italic">W</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
<label>(13)</label>
</disp-formula>
</p>
<p>Where <inline-formula id="inf22">
<mml:math id="m35">
<mml:mrow>
<mml:mi>&#x3bb;</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> is used to regulate the weights of the two losses as hyperparameters of the model.</p>
</sec>
</sec>
<sec id="s4">
<title>4 Experiment and result analysis</title>
<sec id="s4-1">
<title>4.1 Experimental data</title>
<p>The data of this experiment comes from the open-source logging dataset of <xref ref-type="bibr" rid="B26">Xu et al. (2024)</xref>, which includes four wells, GY1, C21, SYY1, and YX58, in GL block, and the purpose layer of this experiment is the QSK layer, and the total depth of the four wells is about 1,542 m. The logging curves include the natural gamma (GR), the deep lateral resistivity (RD), the shallow lateral resistivity (RS), the density (DEN), the neutron (CNL), as input features, and acoustic time difference curve (DT) as prediction curve, with a longitudinal sampling rate of 0.125 m.</p>
<sec id="s4-1-1">
<title>4.1.1 Data preprocessing</title>
<p>Data standardization process is crucial, the main purpose is to eliminate the influence of the magnitude of different logging curves and to ensure the fair contribution of individual logging curve features to the model results during the model training process. It helps to improve the prediction accuracy and convergence speed of the model. The standardization method used this time is the min-max normalization method, and the normalization formula is shown in <xref ref-type="disp-formula" rid="e14">Equation 14</xref>:<disp-formula id="e14">
<mml:math id="m36">
<mml:mrow>
<mml:mi mathvariant="italic">x</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="italic">x</mml:mi>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi mathvariant="italic">x</mml:mi>
<mml:mi mathvariant="italic">min</mml:mi>
</mml:msub>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="italic">x</mml:mi>
<mml:mi mathvariant="italic">max</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi mathvariant="italic">x</mml:mi>
<mml:mi mathvariant="italic">min</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:math>
<label>(14)</label>
</disp-formula>
</p>
<p>Where <inline-formula id="inf23">
<mml:math id="m37">
<mml:mrow>
<mml:mi>x</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf24">
<mml:math id="m38">
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> are the values of the same data point after normalization and before normalization, respectively, and <inline-formula id="inf25">
<mml:math id="m39">
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi mathvariant="italic">max</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf26">
<mml:math id="m40">
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi mathvariant="italic">min</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> are the maximum and minimum values in the features.</p>
<p>After the data processing, the dimensional differences of each well logging curve were eliminated, and the input features had a range of magnitudes of [0,1], while also ensuring the distributional characteristics of the original data (<xref ref-type="fig" rid="F4">Figures 4</xref>, <xref ref-type="fig" rid="F5">5</xref>).</p>
<fig id="F4" position="float">
<label>FIGURE 4</label>
<caption>
<p>Boxplot of logging data distribution before data normalization.</p>
</caption>
<graphic xlink:href="feart-13-1658516-g004.tif">
<alt-text content-type="machine-generated">Box plot displaying the distribution of values for five features: CNL, DEN, GR, RD, and RS. GR has the highest median and shows significant outliers. Other features have lower medians with fewer outliers.</alt-text>
</graphic>
</fig>
<fig id="F5" position="float">
<label>FIGURE 5</label>
<caption>
<p>Boxplot of logging data distribution after data normalization.</p>
</caption>
<graphic xlink:href="feart-13-1658516-g005.tif">
<alt-text content-type="machine-generated">Box plot showing normalized values for five features: CNL, DEN, GR, RD, and RS. Each box displays the median, quartiles, and outliers of the data, with differing heights and positions across features.</alt-text>
</graphic>
</fig>
</sec>
<sec id="s4-1-2">
<title>4.1.2 Feature selection</title>
<p>The accuracy of logging curve reconstruction directly depends on the type of input curve, and optimizing the DT-sensitive curve is the key step. SHAP (SHapleyAdditiveexPlanations), as a powerful feature interpretation tool, can quantify the degree of each feature&#x2019;s contribution to the model output and the interaction effect between features through the game-theoretic method (<xref ref-type="bibr" rid="B25">Wu et al., 2025</xref>). In this logging curve reconstruction analysis, the correlation of different logging curves is first evaluated based on the Person correlation coefficient, and then the influence mechanism of five logging curve features on the target variable DT is analyzed through the XGBoost model combined with the SHAP value, and the sensitive parameters used for DT prediction are screened by combining the two methods.</p>
<p>The magnitude of linear correlation of different logging curves was quantified by Person correlation coefficient analysis, and <xref ref-type="fig" rid="F6">Figure 6</xref> shows that different logging curves show different positive and negative correlations with DT curves, CNL has the highest correlation coefficient of 0.83 with DT, followed by DEN, which has a negative correlation with a coefficient of 0.58, and the rest of the curves show correlation coefficients of less than 0.5 with DT.</p>
<fig id="F6" position="float">
<label>FIGURE 6</label>
<caption>
<p>Heat map of pearson correlation coefficient.</p>
</caption>
<graphic xlink:href="feart-13-1658516-g006.tif">
<alt-text content-type="machine-generated">Correlation matrix displaying relationships between variables: DT, CNL, DEN, GR, RD, and RS. Values range from negative one to one, indicated by colors from red to blue. Pie chart icons illustrate correlation magnitudes.</alt-text>
</graphic>
</fig>
<p>The multilinear-nonlinear relationship was further explored by the XGBoost-SHAP method. According to the characteristic importance plot (<xref ref-type="fig" rid="F7">Figure 7</xref>), the mean absolute value of the SHAP value of CNL is the highest (5.43), indicating that it has the most significant influence on the DT prediction, which is consistent with the geologic law to a certain extent, because the neutron curve directly reflects the formation porosity characteristics, and the acoustic time difference is also closely related to the formation porosity. The significance of RS and GR is the next highest, with the significance of 1.52 and 1.30, respectively. DEN and RD have relatively lower importance, 0.99 and 0.82, respectively, probably because they are more complexly affected by lithology and fluid properties, and their direct correlation with DT is weaker.</p>
<fig id="F7" position="float">
<label>FIGURE 7</label>
<caption>
<p>Histogram of importance of features.</p>
</caption>
<graphic xlink:href="feart-13-1658516-g007.tif">
<alt-text content-type="machine-generated">Horizontal bar chart showing mean absolute SHAP values for features. RD: 0.8218, DEN: 0.9982, GR: 1.2995, RS: 1.5178, CNL: 5.432. CNL has the highest impact.</alt-text>
</graphic>
</fig>
<p>The SHAP summary plot (<xref ref-type="fig" rid="F8">Figure 8</xref>) further reveals the direction of the relationship between the eigenvalues and the model output. High values of CNL (red) correspond to positive SHAP values, indicating that high neutron porosity leads to an increase in the DT value. High values of RS and GR also had a positive effect on DT, while DEN showed a negative correlation.</p>
<fig id="F8" position="float">
<label>FIGURE 8</label>
<caption>
<p>SHAP summary plot (showing the impact and direction of each log feature on DT prediction; color indicates feature magnitude).</p>
</caption>
<graphic xlink:href="feart-13-1658516-g008.tif">
<alt-text content-type="machine-generated">A violin plot displaying SHAP values for model output impact across five features: CNL, RS, GR, DEN, and RD. Colors range from blue (low feature value) to pink (high feature value). This visualization indicates the distribution and influence of each feature on the model.</alt-text>
</graphic>
</fig>
<p>The dependence plot and SHAP interaction effect heatmap (<xref ref-type="fig" rid="F9">Figures 9</xref>, <xref ref-type="fig" rid="F10">10</xref>) indicate that there are significant nonlinear interaction effects among different logging parameters. The synergistic interaction between CNL and RS demonstrates the most pronounced effect (interaction strength &#x3d; 0.408), indicating their combined influence on DT substantially exceeds the sum of their individual contributions, revealing a non-additive effect. The interaction strength between GR and CNL ranks second at 0.367, while that between RS and RD reaches 0.362. These results suggest a significant interaction enhancement effect between lithology - related curves and porosity - related curves.</p>
<fig id="F9" position="float">
<label>FIGURE 9</label>
<caption>
<p>SHAP dependence plot matrix.</p>
</caption>
<graphic xlink:href="feart-13-1658516-g009.tif">
<alt-text content-type="machine-generated">Multiple scatter plots showing SHAP interaction values for different variable combinations: DEN vs. RD, GR vs. RD, GR vs. DEN, RS vs. RD, RS vs. DEN, RS vs. GR, CNL vs. RD, CNL vs. DEN, CNL vs. GR, and CNL vs. RS. Each plot includes a color gradient to indicate interaction values.</alt-text>
</graphic>
</fig>
<fig id="F10" position="float">
<label>FIGURE 10</label>
<caption>
<p>SHAP interaction heatmap.</p>
</caption>
<graphic xlink:href="feart-13-1658516-g010.tif">
<alt-text content-type="machine-generated">Heatmap showing mean interaction strength with absolute SHAP values between five variables: CNL, RS, GR, DEN, and RD. RS and CNL have the highest interaction strength at 0.408. A color gradient from blue (low) to red (high) visualizes the values.</alt-text>
</graphic>
</fig>
<p>Based on the importance of a single feature and the feature interaction effect, CNL, RS, and GR are preferred as the key features for predicting DT, although the interaction effect of RD with RS is also stronger, considering that the same resistivity curve will introduce redundant information, the inclusion of RD logging curve is not considered.</p>
</sec>
<sec id="s4-1-3">
<title>4.1.3 Dataset construction</title>
<p>In sequence prediction research, the sliding window method can fully utilize the contextual relevance of long sequence data and is the core method for constructing training samples. The deep sequence data is divided by the sliding window method to construct the sample format that meets the input requirements.</p>
<p>As shown in <xref ref-type="fig" rid="F11">Figure 11</xref>, a fixed window length w and step length s are used for sample set construction, the input features are CNL, RS and GR curves, and the labels are DT curves, and the DT values of the next depth point are predicted with consecutive input curves (CNL, RS, GR) of length w along the direction of increasing depth, and one sample can be constructed within the window for each moving step. A total of 11,986 sample sets were systematically constructed for model development and evaluation. The dataset from wells C21 and GY1 was partitioned into training (80%) and validation (20%) subsets, with the former employed for parameter optimization and the latter for real-time prediction monitoring and overfitting prevention. For independent model assessment, wells SYY1 and YX58 were reserved as hold-out test sets to evaluate practical application performance.</p>
<fig id="F11" position="float">
<label>FIGURE 11</label>
<caption>
<p>Schematic diagram of the sliding window method.</p>
</caption>
<graphic xlink:href="feart-13-1658516-g011.tif">
<alt-text content-type="machine-generated">Graphical representation of sliding window analysis across three colored time series data. Each series is segmented with windows of size \(w\) moving in the sliding direction. Step size \(s\) is marked. Arrows indicate prediction for the sonic profile in aggregate data, highlighting future value projection.</alt-text>
</graphic>
</fig>
</sec>
</sec>
<sec id="s4-2">
<title>4.2 Evaluation metrics</title>
<p>This study employs a comprehensive set of quantitative metrics to assess the model&#x2019;s performance in curve reconstruction tasks. Four key evaluation indicators are utilized: Mean Squared Error (MSE), Mean Absolute Error (MAE), Coefficient of Determination (R<sup>2</sup>), and Mean Absolute Percentage Error (MAPE). Among these metrics, MSE and MAE primarily measure the magnitude of absolute deviations between the reconstructed curves and their corresponding ground truth values. The former emphasizes the overall degree of dispersion, while the latter highlights the magnitude of the average deviation. To evaluate the model&#x2019;s curve-fitting capability from the perspective of variance interpretation, the R<sup>2</sup> quantifies how well the reconstructed curves explain the variance in the original data. MAPE is a relative error measure that eliminates the impact of dimensions. The formula for MSE is shown in <xref ref-type="disp-formula" rid="e10">Equation 10</xref> and the calculations for the other indicators are shown in <xref ref-type="disp-formula" rid="e15">Equations 15</xref>&#x2013;<xref ref-type="disp-formula" rid="e17">17</xref>:<disp-formula id="e15">
<mml:math id="m41">
<mml:mrow>
<mml:mtext>MAE</mml:mtext>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">m</mml:mi>
</mml:mrow>
</mml:mfrac>
<mml:mrow>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi mathvariant="italic">m</mml:mi>
</mml:munderover>
</mml:mstyle>
<mml:mrow>
<mml:mfenced open="|" close="|" separators="|">
<mml:mrow>
<mml:mover accent="true">
<mml:msub>
<mml:mi mathvariant="italic">y</mml:mi>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:msub>
<mml:mo>&#x5e;</mml:mo>
</mml:mover>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi mathvariant="italic">y</mml:mi>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(15)</label>
</disp-formula>
<disp-formula id="e16">
<mml:math id="m42">
<mml:mrow>
<mml:msup>
<mml:mi mathvariant="italic">R</mml:mi>
<mml:mn>2</mml:mn>
</mml:msup>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mstyle displaystyle="true">
<mml:msubsup>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi mathvariant="italic">m</mml:mi>
</mml:msubsup>
</mml:mstyle>
<mml:msup>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mover accent="true">
<mml:msub>
<mml:mi mathvariant="italic">y</mml:mi>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:msub>
<mml:mo>&#x5e;</mml:mo>
</mml:mover>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi mathvariant="italic">y</mml:mi>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:msup>
</mml:mrow>
<mml:mrow>
<mml:mstyle displaystyle="true">
<mml:msubsup>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi mathvariant="italic">m</mml:mi>
</mml:msubsup>
</mml:mstyle>
<mml:msup>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mover accent="true">
<mml:mi mathvariant="italic">y</mml:mi>
<mml:mo>&#xaf;</mml:mo>
</mml:mover>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi mathvariant="italic">y</mml:mi>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:msup>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:math>
<label>(16)</label>
</disp-formula>
<disp-formula id="e17">
<mml:math id="m43">
<mml:mrow>
<mml:mtext>MAPE</mml:mtext>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="italic">m</mml:mi>
</mml:mrow>
</mml:mfrac>
<mml:mrow>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi mathvariant="italic">i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi mathvariant="italic">m</mml:mi>
</mml:munderover>
</mml:mstyle>
<mml:mrow>
<mml:mfenced open="|" close="|" separators="|">
<mml:mrow>
<mml:mfrac>
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="italic">y</mml:mi>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:mover accent="true">
<mml:msub>
<mml:mi mathvariant="italic">y</mml:mi>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:msub>
<mml:mo>&#x5e;</mml:mo>
</mml:mover>
</mml:mrow>
<mml:msub>
<mml:mi mathvariant="italic">y</mml:mi>
<mml:mi mathvariant="italic">i</mml:mi>
</mml:msub>
</mml:mfrac>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>100</mml:mn>
<mml:mo>%</mml:mo>
</mml:mrow>
</mml:math>
<label>(17)</label>
</disp-formula>
</p>
<p>Where <inline-formula id="inf27">
<mml:math id="m44">
<mml:mrow>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> is the number of samples, <inline-formula id="inf28">
<mml:math id="m45">
<mml:mrow>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> denotes the true value of the ith sample, and <inline-formula id="inf29">
<mml:math id="m46">
<mml:mrow>
<mml:mover accent="true">
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>&#x5e;</mml:mo>
</mml:mover>
</mml:mrow>
</mml:math>
</inline-formula> is the corresponding model prediction.</p>
<p>Lower values of MSE, MAE, and MAPE indicate higher reconstruction accuracy, while an R<sup>2</sup> value closer to 1 reflects better curve-fitting performance.</p>
</sec>
<sec id="s4-3">
<title>4.3 Experimental process</title>
<p>The workflow for reconstructing the DT curve based on the model proposed in this paper is shown in the <xref ref-type="fig" rid="F12">Figure 12</xref>. First, preprocessing is performed on the collected curves, including outlier removal and normalization. Then, the optimized CNL, RS, and GR curves are decomposed using VMD. Additionally, the DT curve to be predicted also undergoes decomposition. On this basis, prediction models are established for each component IMF. Finally, all predicted values are superimposed to obtain the final reconstructed curve.</p>
<fig id="F12" position="float">
<label>FIGURE 12</label>
<caption>
<p>Algorithmic process.</p>
</caption>
<graphic xlink:href="feart-13-1658516-g012.tif">
<alt-text content-type="machine-generated">Flowchart illustrating a process starting with data preprocessing, followed by feature selection. Features CNL, RS, and GR are processed through three models (Model1, Model2, Model3) using IMF1, IMF2, and IMF3, producing outputs. Outputs predict an acoustic curve, leading to the end of the process.</alt-text>
</graphic>
</fig>
</sec>
<sec id="s4-4">
<title>4.4 Model training</title>
<p>The experiment was run on Window11 operating system, using Python programming language and Tensorflow deep learning framework, using a computer configuration of NVIDIA RTX 3090 with 16G video memory. The model uses the above combination function as the loss function and the Adam optimizer, and the individual hyperparameters of the experiment are set as follows, with the Batchsize set to 32, the initial learning rate set to 0.01, <inline-formula id="inf30">
<mml:math id="m47">
<mml:mrow>
<mml:mi>&#x3bb;</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> set to 0.7, and 64 training iterations.</p>
<p>
<xref ref-type="fig" rid="F13">Figure 13</xref> shows the trend of the loss values of different component prediction models after VMD decomposition with the number of iterations, and it can be seen that with the increase of the number of training times, the loss values of the model are decreasing, and gradually converge to a stable state, and finally reach the convergence state.</p>
<fig id="F13" position="float">
<label>FIGURE 13</label>
<caption>
<p>Loss function descent plot.</p>
</caption>
<graphic xlink:href="feart-13-1658516-g013.tif">
<alt-text content-type="machine-generated">Three line graphs display training and validation loss across epochs for IMF1, IMF2, and IMF3. Each graph shows a red line for training loss and a blue line for validation loss, with all losses decreasing as epochs progress.</alt-text>
</graphic>
</fig>
</sec>
<sec id="s4-5">
<title>4.5 Application effect analysis</title>
<p>The trained model is applied to two test wells, thus demonstrating the practical application effect of the model.</p>
<p>
<xref ref-type="fig" rid="F14">Figures 14</xref>, <xref ref-type="fig" rid="F15">15</xref> respectively present the scatter plots comparing the predicted and measured values of the acoustic time difference (DT) for the SYY-1 well and the YX58 well. The scattered points are mainly distributed near the 45&#xb0; diagonal line, indicating a good linear consistency between the two. Specifically, for <xref ref-type="fig" rid="F14">Figure 14</xref> (SYY-1 well), the coefficient of determination R<sup>2</sup> is 0.8783, and the slope of the regression equation is 0.8231; for <xref ref-type="fig" rid="F15">Figure 15</xref> (YX58 well), the coefficient of determination R<sup>2</sup> is 0.7142, and the slope of the regression equation is 0.6354. There is a certain difference in the prediction results of the two wells. This is because the similarity of the logging curves between the YX58 well and the training well is lower than that of the SYY1 well, and at the same time, the formation thickness of the YX58 well is much smaller than that of the training well (<xref ref-type="bibr" rid="B24">Wu et al., 2024</xref>), reflecting the differences in sedimentary characteristics. Therefore, the difference in the prediction results of the two wells is acceptable. Furthermore, single-well logging curves are plotted. In the DT curve track of <xref ref-type="fig" rid="F16">Figure 16</xref>, the blue and yellow curves denote the true and predicted values, respectively. The results demonstrate that the proposed method achieves accurate predictions for the acoustic curves in both wells. Specifically, the predicted curve closely follows the overall trend of the true curve, effectively capturing its amplitude variations. Furthermore, the model reliably reproduces key features, including peak and valley positions, indicating strong agreement between predictions and ground truth. This indicates that the model can effectively uncover the correlations among different logging curves, and learn the local undulation characteristics, long-distance variation trends, and sequential correlations of the curves.</p>
<fig id="F14" position="float">
<label>FIGURE 14</label>
<caption>
<p>Scatterplot of raw and predicted acoustic curve values for SYY1 well.</p>
</caption>
<graphic xlink:href="feart-13-1658516-g014.tif">
<alt-text content-type="machine-generated">Scatter plot showing a positive correlation between predicted values on the x-axis and true values on the y-axis, with a linear regression line in red. The equation is y &#x3d; 0.8231x &#x2b; 15.538 with R&#xB2; &#x3d; 0.8783. Points are clustered around the line, indicating a strong fit.</alt-text>
</graphic>
</fig>
<fig id="F15" position="float">
<label>FIGURE 15</label>
<caption>
<p>Scatterplot of raw and predicted acoustic curve values for YX58 well.</p>
</caption>
<graphic xlink:href="feart-13-1658516-g015.tif">
<alt-text content-type="machine-generated">Scatter plot displaying the relationship between predicted and true values, with a red trend line indicating a positive correlation. The equation is y &#x3d; 0.6354x &#x2b; 32.863, and the R&#xB2; value is 0.7142.</alt-text>
</graphic>
</fig>
<fig id="F16" position="float">
<label>FIGURE 16</label>
<caption>
<p>Logging curve of SYY1 well (Tracks from left to right: DT (yellow &#x3d; VMD-CNN-BiLSTM prediction, blue &#x3d; measured), CNL, DEN, GR, RD, and RS).</p>
</caption>
<graphic xlink:href="feart-13-1658516-g016.tif">
<alt-text content-type="machine-generated">Log chart with six vertical tracks showing various geophysical measurements. From left to right: DT in microseconds per foot, CNL in percentage, DEN in grams per cubic centimeter, GR in API units, RD in ohm-meters, and RS in ohm-meters. Depth ranges from 2100 to 2400 meters. Each track displays fluctuating line graphs indicative of measurement variations with depth.</alt-text>
</graphic>
</fig>
</sec>
<sec id="s4-6">
<title>4.6 Comparison experiments</title>
<p>To validate the effectiveness of the proposed method, we conducted comparative experiments against several conventional machine learning approaches, including Support Vector Regression (SVR), Random Forest, and standard LSTM models. The performance metrics of these models on the validation set are presented in <xref ref-type="table" rid="T1">Table 1</xref>, enabling a comprehensive evaluation of their relative strengths and limitations.</p>
<table-wrap id="T1" position="float">
<label>TABLE 1</label>
<caption>
<p>Evaluation metrics performance of different models on the test set.</p>
</caption>
<table>
<thead valign="top">
<tr style="background-color:#A6A6A6">
<th align="center">Model</th>
<th align="center">MSE</th>
<th align="center">MAE</th>
<th align="center">MAPE</th>
<th align="center">R2</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="center">SVR</td>
<td align="center">64.21</td>
<td align="center">6.33</td>
<td align="center">6.4%</td>
<td align="center">0.31</td>
</tr>
<tr>
<td align="center">Random Forest</td>
<td align="center">58.60</td>
<td align="center">6.01</td>
<td align="center">6.0%</td>
<td align="center">0.37</td>
</tr>
<tr>
<td align="center">LSTM</td>
<td align="center">50.83</td>
<td align="center">5.73</td>
<td align="center">5.7%</td>
<td align="center">0.46</td>
</tr>
<tr>
<td align="center">VMD-CNN-BiLSTM</td>
<td align="center">30.30</td>
<td align="center">4.20</td>
<td align="center">4.1%</td>
<td align="center">0.67</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>From the data in the table, it can be seen that the VMD-CNN-BiLSTM model shows the optimal performance with MSE of 30.30, MAE of 4.20, MAPE of 0.041, and the fitting effect of R<sup>2</sup> reaches 0.67. Compared with the other models, it has reduced the error metrics, significantly improved the prediction accuracy, and the best reconstruction of acoustic wave curves.</p>
<p>The performance of the models can be further visualized from the corresponding test well prediction curve plots (<xref ref-type="fig" rid="F17">Figure 17</xref>), where the green curve represents the predicted value and the blue curve represents the true labeled value. The SVR model exhibits significant deviations from the true curves in both morphological structure and absolute values, particularly in high-variability segments where prediction errors are most pronounced. While the Random Forest model demonstrates measurable improvement over SVR, it still shows limitations in capturing fine-scale variations. The LSTM model achieves superior performance overall, faithfully reconstructing the general trend of true curves across most depth intervals. However, its predictive accuracy diminishes in zones of rapid curve fluctuation, notably around the 2000 m depth region where complex patterns emerge. The VMD-CNN-BiLSTM model is the closest to the real labeled curves, and it can reconstruct the overall trend of the curves and the local peaks and valleys in the whole depth range. The results show that the VMD-CNN-BiLSTM model has better application in logging curve reconstruction.</p>
<fig id="F17" position="float">
<label>FIGURE 17</label>
<caption>
<p>Comparison of different model prediction results and real logging curve of well YX58.</p>
</caption>
<graphic xlink:href="feart-13-1658516-g017.tif">
<alt-text content-type="machine-generated">Four line graphs compare predicted and true values across different depths from 1850 to 2150. The models used are VMD-CNN-BiLSTM, LSTM, Random Forest, and SVR. In each graph, green represents predictions, while blue represents true values. The vertical axis for DT ranges from 50 to 200.</alt-text>
</graphic>
</fig>
</sec>
</sec>
<sec sec-type="conclusion" id="s5">
<title>5 Conclusion</title>
<p>Aiming at the problems of missing and distorted data caused by irresistible factors during the acquisition of logging curves, this paper applies a VMD-CNN-BiLSTM cascade network model for DT reconstruction considering logging curves as a kind of depth sequence data, which has a good application in sequence prediction tasks. Through comprehensive feature selection, we identified CNL, GR, and RS curves as optimal input features due to their strong correlation with target variables. The variational mode decomposition (VMD) method was employed to decompose these curves into intrinsic mode functions. Distinct prediction models were then developed for each frequency component, with the final reconstruction achieved through superposition of all modal predictions.</p>
<p>This method breaks through the limitations of traditional feature selection based on linear correlation and point-to-point prediction in machine learning. It introduces the XGBoost-SHAP method to screen important features in a way that is interpretable, and innovatively implements a time series modeling model based on feature decomposition. Compared with traditional machine learning and simple long short-term memory neural networks, this method achieves better reconstruction results. Additionally, this method can be extended to reconstruct other well logging curves by adjusting parameters, and can also be used to train and predict well logging curve for other strata by adjusting the data set. This research to some extent can provide certain reference significance for tasks such as well logging curve reconstruction or completion.</p>
</sec>
</body>
<back>
<sec sec-type="data-availability" id="s6">
<title>Data availability statement</title>
<p>The original contributions presented in the study are included in the article/supplementary material, further inquiries can be directed to the corresponding author.</p>
</sec>
<sec sec-type="author-contributions" id="s7">
<title>Author contributions</title>
<p>HW: Data curation, Conceptualization, Investigation, Writing &#x2013; original draft, Methodology, Writing &#x2013; review and editing, Formal Analysis. YZ: Data curation, Writing &#x2013; review and editing, Conceptualization, Formal Analysis. JL: Software, Investigation, Validation, Writing &#x2013; review and editing, Conceptualization. ST: Validation, Writing &#x2013; review and editing, Investigation, Software. YW: Software, Investigation, Validation, Writing &#x2013; review and editing. XS: Validation, Investigation, Software, Writing &#x2013; review and editing. MZ: Validation, Writing &#x2013; review and editing, Investigation, Software. SL: Software, Writing &#x2013; review and editing, Investigation, Validation. ZL: Validation, Investigation, Writing &#x2013; review and editing, Software.</p>
</sec>
<sec sec-type="funding-information" id="s8">
<title>Funding</title>
<p>The author(s) declare that no financial support was received for the research and/or publication of this article.</p>
</sec>
<sec sec-type="COI-statement" id="s9">
<title>Conflict of interest</title>
<p>Authors HW, YZ, JL, ST, YW, XS, MZ, SL, and ZL were employed by Shandong Leading Petro-Tech Co., Ltd.</p>
</sec>
<sec sec-type="ai-statement" id="s10">
<title>Generative AI statement</title>
<p>The author(s) declare that no Generative AI was used in the creation of this manuscript.</p>
<p>Any alternative text (alt text) provided alongside figures in this article has been generated by Frontiers with the support of artificial intelligence and reasonable efforts have been made to ensure accuracy, including review by the authors wherever possible. If you identify any issues, please contact us.</p>
</sec>
<sec sec-type="disclaimer" id="s11">
<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="confproc">
<person-group person-group-type="author">
<name>
<surname>Afifi</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Anifowose</surname>
<given-names>F.</given-names>
</name>
</person-group> (<year>2023</year>). &#x201c;<article-title>Compressional sonic log prediction experiment using machine learning: Algorithms and feature selection</article-title>,&#x201d; in <conf-name>Paper presented at the Fifth EAGE Borehole Geology Workshop</conf-name>, <conf-loc>Riyadh, Saudi Arabia</conf-loc> (<publisher-name>EAGE</publisher-name>). <pub-id pub-id-type="doi">10.3997/2214-4609.2023631004</pub-id>
</citation>
</ref>
<ref id="B2">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Aftab</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Moghadam</surname>
<given-names>R. H.</given-names>
</name>
<name>
<surname>Leisi</surname>
<given-names>A.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>New interpretation approach of well logging data for evaluation of kern aquifer in south California</article-title>. <source>J. Appl. Geophys.</source> <volume>215</volume>, <fpage>105138</fpage>. <pub-id pub-id-type="doi">10.1016/j.jappgeo.2023.105138</pub-id>
</citation>
</ref>
<ref id="B3">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Chen</surname>
<given-names>G. H.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>Y. G.</given-names>
</name>
</person-group> (<year>2005</year>). <article-title>Application of Faust formula in acoustic curve reconstruction</article-title>. <source>Prog. Exploration Geophys.</source> (<issue>02</issue>), <fpage>125</fpage>&#x2013;<lpage>128&#x2b;10</lpage>.</citation>
</ref>
<ref id="B4">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Cuturi</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Blondel</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2017</year>). &#x201c;<article-title>Soft-dtw: a differentiable loss function for time-series</article-title>,&#x201d; in <conf-name>International Conference on Machine Learning</conf-name> (<publisher-name>PMLR</publisher-name>), <fpage>894</fpage>&#x2013;<lpage>903</lpage>.</citation>
</ref>
<ref id="B5">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Dragomiretskiy</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Zosso</surname>
<given-names>D.</given-names>
</name>
</person-group> (<year>2013</year>). <article-title>Variational mode decomposition</article-title>. <source>IEEE Trans. Signal Process.</source> <volume>62</volume> (<issue>3</issue>), <fpage>531</fpage>&#x2013;<lpage>544</lpage>. <pub-id pub-id-type="doi">10.1109/tsp.2013.2288675</pub-id>
</citation>
</ref>
<ref id="B6">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Gama</surname>
<given-names>P. H. T.</given-names>
</name>
<name>
<surname>Faria</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Sena</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Neves</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Riffel</surname>
<given-names>V. R.</given-names>
</name>
<name>
<surname>Perez</surname>
<given-names>L.</given-names>
</name>
<etal/>
</person-group> (<year>2025</year>). <article-title>Imputation in well log data: a benchmark for machine learning methods</article-title>. <source>Comput. Geosciences</source> <volume>196</volume>, <fpage>105789</fpage>. <pub-id pub-id-type="doi">10.1016/j.cageo.2024.105789</pub-id>
</citation>
</ref>
<ref id="B7">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Hochreiter</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Schmidhuber</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>1997</year>). <article-title>Long short-term memory</article-title>. <source>Neural Comput.</source> <volume>9</volume> (<issue>8</issue>), <fpage>1735</fpage>&#x2013;<lpage>1780</lpage>. <pub-id pub-id-type="doi">10.1162/neco.1997.9.8.1735</pub-id>
<pub-id pub-id-type="pmid">9377276</pub-id>
</citation>
</ref>
<ref id="B8">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ibrahim</surname>
<given-names>A. F.</given-names>
</name>
<name>
<surname>Elkatatny</surname>
<given-names>S.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>Real-time GR logs estimation while drilling using surface drilling data; AI application</article-title>. <source>Arabian J. Sci. Eng.</source> <volume>47</volume> (<issue>9</issue>), <fpage>11187</fpage>&#x2013;<lpage>11196</lpage>. <pub-id pub-id-type="doi">10.1007/s13369-021-05854-7</pub-id>
</citation>
</ref>
<ref id="B9">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Jiang</surname>
<given-names>J. J.</given-names>
</name>
<name>
<surname>Lai</surname>
<given-names>S. X.</given-names>
</name>
<name>
<surname>Jin</surname>
<given-names>L. W.</given-names>
</name>
<name>
<surname>Zhu</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>Dsdtw: local representation learning with deep soft-dtw for dynamic signature verification</article-title>. <source>IEEE Trans. Inf. Forensics Secur.</source> <volume>17</volume>, <fpage>2198</fpage>&#x2013;<lpage>2212</lpage>. <pub-id pub-id-type="doi">10.1109/tifs.2022.3180219</pub-id>
</citation>
</ref>
<ref id="B10">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Kim</surname>
<given-names>M. J.</given-names>
</name>
<name>
<surname>Cho</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>2024</year>). <article-title>Imputation of missing values in well log data using k-nearest neighbor collaborative filtering</article-title>. <source>Comput. Geosciences</source> <volume>193</volume>, <fpage>105712</fpage>. <pub-id pub-id-type="doi">10.1016/j.cageo.2024.105712</pub-id>
</citation>
</ref>
<ref id="B11">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Li</surname>
<given-names>Z. H.</given-names>
</name>
<name>
<surname>Jiang</surname>
<given-names>S.</given-names>
</name>
</person-group> (<year>2025</year>). <article-title>Based on machine learning and SHAP algorithm of acoustic well logging curve recon-struction and interpretability analysis</article-title>. <source>Bull. Geotechnical Sci. Eng.</source> <volume>44</volume> (<issue>01</issue>), <fpage>321</fpage>&#x2013;<lpage>331</lpage>. <pub-id pub-id-type="doi">10.19509/j.cnki.dzkq.tb20230504</pub-id>
</citation>
</ref>
<ref id="B12">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Li</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>Yu</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Tian</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Xu</surname>
<given-names>B. X.</given-names>
</name>
</person-group> (<year>2016</year>). <article-title>Discussion on acoustic and density well logging curve reconstruction method for reservoir prediction of Longfengshan Yingcheng formation&#x2014;A case study of well LB1</article-title>. <source>Oil and Gas Reserv. Eval. Dev.</source> <volume>6</volume> (<issue>04</issue>), <fpage>18</fpage>&#x2013;<lpage>22</lpage>. <pub-id pub-id-type="doi">10.13809/j.cnki.cn32-1825/te.2016.04.004</pub-id>
</citation>
</ref>
<ref id="B13">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Li</surname>
<given-names>F. L.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>H. S.</given-names>
</name>
<name>
<surname>Yang</surname>
<given-names>X. L.</given-names>
</name>
<name>
<surname>Zhao</surname>
<given-names>M. X.</given-names>
</name>
<name>
<surname>Yang</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>L. C.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>Based on U-Net neural network of acoustic well logging curve reconstruction</article-title>. <source>J. Ocean Univ. China</source> <volume>53</volume> (<issue>08</issue>), <fpage>86</fpage>&#x2013;<lpage>92&#x2b;103</lpage>. <pub-id pub-id-type="doi">10.16441/j.cnki.hdxb.20220239</pub-id>
</citation>
</ref>
<ref id="B14">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Liao</surname>
<given-names>M. H.</given-names>
</name>
</person-group> (<year>2014</year>). <article-title>Correction of the influence of expansion on density and acoustic curves using multiple re-gression methods</article-title>. <source>Geophys. Prospect.</source> <volume>38</volume> (<issue>01</issue>), <fpage>174</fpage>&#x2013;<lpage>179&#x2b;184</lpage>.</citation>
</ref>
<ref id="B15">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Liu</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>Q.</given-names>
</name>
<name>
<surname>You</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>Sacchi</surname>
<given-names>M. D.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>W.</given-names>
</name>
</person-group> (<year>2024</year>). <article-title>Filling the gap: enhancing borehole imaging with tensor neural network</article-title>. <source>&#x2a;Geophysics&#x2a;</source>, <fpage>1</fpage>&#x2013;<lpage>64</lpage>. <pub-id pub-id-type="doi">10.1190/geo2024-0242.1</pub-id>
</citation>
</ref>
<ref id="B16">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Liu</surname>
<given-names>J. J.</given-names>
</name>
<name>
<surname>Zhou</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Yu</surname>
<given-names>W. D.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>J. H.</given-names>
</name>
<name>
<surname>Fan</surname>
<given-names>Q.</given-names>
</name>
<name>
<surname>Yan</surname>
<given-names>G. H.</given-names>
</name>
</person-group> (<year>2024</year>). <article-title>Based on hyperparameter optimized LSTM of acoustic well logging curve generation technology</article-title>. <source>Petroleum Geophysics</source> <volume>63</volume> (<issue>05</issue>), <fpage>1061</fpage>&#x2013;<lpage>1074</lpage>.</citation>
</ref>
<ref id="B17">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Nero</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Aning</surname>
<given-names>A. A.</given-names>
</name>
<name>
<surname>Danuor</surname>
<given-names>S. K.</given-names>
</name>
<name>
<surname>Mensah</surname>
<given-names>V.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>Prediction of compressional sonic log in the western (Tano) sedimentary basin of Ghana, West Africa using supervised machine learning algorithms</article-title>. <source>Heliyon</source> <volume>9</volume> (<issue>9</issue>), <fpage>e20242</fpage>. <pub-id pub-id-type="doi">10.1016/j.heliyon.2023.e20242</pub-id>
<pub-id pub-id-type="pmid">37809898</pub-id>
</citation>
</ref>
<ref id="B18">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Qu</surname>
<given-names>F. T.</given-names>
</name>
<name>
<surname>Xu</surname>
<given-names>Y. Q.</given-names>
</name>
<name>
<surname>Liao</surname>
<given-names>H. L.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Geng</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Han</surname>
<given-names>L.</given-names>
</name>
</person-group> (<year>2025</year>). <article-title>Missing data interpolation in well logs based on genera-tive adversarial network and improved krill herd algorithm</article-title>. <source>Geoenergy Science and Engineering</source> <volume>246</volume>, <fpage>213538</fpage>. <pub-id pub-id-type="doi">10.1016/j.geoen.2024.213538</pub-id>
</citation>
</ref>
<ref id="B19">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Redwan</surname>
<given-names>U. G.</given-names>
</name>
<name>
<surname>Zaman</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Mizan</surname>
<given-names>H. B.</given-names>
</name>
</person-group> (<year>2025</year>). <article-title>Spatio-temporal CNN-BiLSTM dynamic approach to emotion recog-nition based on EEG signal</article-title>. <source>Computers in Biology and Medicine</source> <volume>192</volume> (<issue>Pt A</issue>), <fpage>110277</fpage>. <pub-id pub-id-type="doi">10.1016/j.compbiomed.2025.110277</pub-id>
<pub-id pub-id-type="pmid">40294481</pub-id>
</citation>
</ref>
<ref id="B20">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Saleh</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Mabrouk</surname>
<given-names>W. M.</given-names>
</name>
<name>
<surname>Metwally</surname>
<given-names>A.</given-names>
</name>
</person-group> (<year>2025</year>). <article-title>Machine learning model optimization for compressional sonic log prediction using well logs in Shahd SE field, Western Desert, Egypt</article-title>. <source>Scientific Reports</source> <volume>15</volume>, <fpage>14957</fpage>. <pub-id pub-id-type="doi">10.1038/s41598-025-97938-9</pub-id>
<pub-id pub-id-type="pmid">40301475</pub-id>
</citation>
</ref>
<ref id="B21">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Shang</surname>
<given-names>F. H.</given-names>
</name>
<name>
<surname>Lu</surname>
<given-names>Y. Y.</given-names>
</name>
<name>
<surname>Cao</surname>
<given-names>M. J.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>Based on improved LSTM neural network of well logging curve reconstruc-tion method</article-title>. <source>Computer Technology and Development</source> <volume>32</volume> (<issue>06</issue>), <fpage>198</fpage>&#x2013;<lpage>202</lpage>.</citation>
</ref>
<ref id="B22">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wang</surname>
<given-names>J. R.</given-names>
</name>
<name>
<surname>Liang</surname>
<given-names>L. W.</given-names>
</name>
<name>
<surname>Deng</surname>
<given-names>Q.</given-names>
</name>
<name>
<surname>Tian</surname>
<given-names>P. P.</given-names>
</name>
<name>
<surname>Tan</surname>
<given-names>W. X.</given-names>
</name>
</person-group> (<year>2016</year>). <article-title>Research and application of well logging curve recon-struction method based on multiple regression model</article-title>. <source>Lithologic Reservoirs</source> <volume>28</volume> (<issue>03</issue>), <fpage>113</fpage>&#x2013;<lpage>120</lpage>.</citation>
</ref>
<ref id="B23">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wang</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Cao</surname>
<given-names>J. X.</given-names>
</name>
<name>
<surname>You</surname>
<given-names>J. C.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Based on GRU neural network of well logging curve reconstruction</article-title>. <source>Petroleum Earth Physics Exploration</source> <volume>55</volume> (<issue>03</issue>), <fpage>510</fpage>&#x2013;<lpage>520&#x2b;468</lpage>. <pub-id pub-id-type="doi">10.13810/j.cnki.issn.1000-7210.2020.03.004</pub-id>
</citation>
</ref>
<ref id="B24">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wu</surname>
<given-names>T. F.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Xi</surname>
<given-names>Y. F.</given-names>
</name>
<name>
<surname>Zhao</surname>
<given-names>Z. C.</given-names>
</name>
</person-group> (<year>2024</year>). <article-title>Intent recognition model based on sequential information and sen-tence features</article-title>. <source>Neurocomputing</source>, <fpage>566</fpage>. <pub-id pub-id-type="doi">10.1016/j.neucom.2023.127054</pub-id>
</citation>
</ref>
<ref id="B25">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wu</surname>
<given-names>Z. Z.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>S. Z.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>L. Y.</given-names>
</name>
<name>
<surname>Suo</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>2025</year>). <article-title>An interpretable ship risk model based on machine learning and SHAP interpretation technique</article-title>. <source>Ocean Engineering</source> <volume>335</volume>, <fpage>121686</fpage>. <pub-id pub-id-type="doi">10.1016/j.oceaneng.2025.121686</pub-id>
</citation>
</ref>
<ref id="B26">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Xu</surname>
<given-names>B. S.</given-names>
</name>
<name>
<surname>Zhou</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Zhou</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Shao</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Wu</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>P.</given-names>
</name>
<etal/>
</person-group> (<year>2024</year>). <article-title>Transfer learning for well logging formation evaluation using similarity weights</article-title>. <source>Artificial Intelligence in Geosciences</source> <volume>5</volume>, <fpage>100091</fpage>. <pub-id pub-id-type="doi">10.1016/j.aiig.2024.100091</pub-id>
</citation>
</ref>
<ref id="B27">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Yin</surname>
<given-names>J. Y.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>X. J.</given-names>
</name>
<name>
<surname>Yang</surname>
<given-names>R. R.</given-names>
</name>
<name>
<surname>Xie</surname>
<given-names>Z. R.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>Z. Q.</given-names>
</name>
</person-group> (<year>2014</year>). <article-title>Application of multi-well logging curve pseudo-acoustic re-construction technology</article-title>. <source>Xinjiang Petroleum Geology</source> <volume>35</volume> (<issue>04</issue>), <fpage>461</fpage>&#x2013;<lpage>465</lpage>.</citation>
</ref>
<ref id="B28">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Yuan</surname>
<given-names>Q. S.</given-names>
</name>
<name>
<surname>Zhou</surname>
<given-names>J. X.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>G. D.</given-names>
</name>
</person-group> (<year>2009</year>). <article-title>The application of acoustic well logging curve reconstruction tech-nology in reservoir prediction</article-title>. <source>China Offshore Oil and Gas</source> <volume>21</volume> (<issue>01</issue>), <fpage>23</fpage>&#x2013;<lpage>26</lpage>.</citation>
</ref>
<ref id="B29">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhai</surname>
<given-names>X. Y.</given-names>
</name>
<name>
<surname>Gao</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>Y. G.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Gui</surname>
<given-names>Z. X.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>Z. Z.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>Fusion attention mechanism of two-dimensional con-volutional neural network well logging curve reconstruction method</article-title>. <source>Petroleum Earth Physics Exploration</source> <volume>58</volume> (<issue>05</issue>), <fpage>1031</fpage>&#x2013;<lpage>1041</lpage>. <pub-id pub-id-type="doi">10.13810/j.cnki.issn.1000-7210.2023.05.001</pub-id>
</citation>
</ref>
<ref id="B30">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhan</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>Q.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Sacchi</surname>
<given-names>M. D.</given-names>
</name>
<name>
<surname>Zhuang</surname>
<given-names>M.</given-names>
</name>
<etal/>
</person-group> (<year>2024</year>). <article-title>Simultaneous prediction of petrophysical properties and formation layered thickness from acoustic logging data using a modular cascading residual neural network (MCARNN) with physical constraints</article-title>. <source>&#x2a;Journal of Applied Geophysics&#x2a;</source> <volume>224</volume>, <fpage>105362</fpage>. <pub-id pub-id-type="doi">10.1016/j.jappgeo.2024.105362</pub-id>
</citation>
</ref>
<ref id="B31">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname>
<given-names>J. C.</given-names>
</name>
<name>
<surname>Deng</surname>
<given-names>J. G.</given-names>
</name>
<name>
<surname>Tan</surname>
<given-names>Q.</given-names>
</name>
<name>
<surname>Shi</surname>
<given-names>L.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>Well logging curve reconstruction method based on XGBoost</article-title>. <source>Petroleum Earth Physics Exploration</source> <volume>57</volume> (<issue>03</issue>), <fpage>697</fpage>&#x2013;<lpage>705&#x2b;496</lpage>. <pub-id pub-id-type="doi">10.13810/j.cnki.issn.1000-7210.2022.03.020</pub-id>
</citation>
</ref>
<ref id="B32">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhang</surname>
<given-names>H. Y.</given-names>
</name>
<name>
<surname>Wu</surname>
<given-names>W. S.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>Z. X.</given-names>
</name>
<name>
<surname>Jing</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2024</year>). <article-title>Well logs reconstruction of petroleum energy exploration based on bidirectional long Short-term memory networks with a PSO optimization algorithm</article-title>. <source>Geoenergy Science and Engineering</source> <volume>239</volume>, <fpage>212975</fpage>. <pub-id pub-id-type="doi">10.1016/j.geoen.2024.212975</pub-id>
</citation>
</ref>
<ref id="B33">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhao</surname>
<given-names>P. Q.</given-names>
</name>
<name>
<surname>Zhuang</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Sun</surname>
<given-names>Z. C.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Luo</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Mao</surname>
<given-names>Z.</given-names>
</name>
<etal/>
</person-group> (<year>2016</year>). <article-title>Methods for estimating petrophysical parameters from well logs in tight oil reservoirs: a case study</article-title>. <source>Journal of Geophysics and Engineering</source> <volume>13</volume> (<issue>01</issue>), <fpage>78</fpage>&#x2013;<lpage>85</lpage>. <pub-id pub-id-type="doi">10.1088/1742-2132/13/1/78</pub-id>
</citation>
</ref>
<ref id="B34">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhou</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Zhao</surname>
<given-names>H. H.</given-names>
</name>
<name>
<surname>Jiang</surname>
<given-names>Y. F.</given-names>
</name>
<name>
<surname>Yi</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Lai</surname>
<given-names>F. Q.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>Based on the cascaded bidirectional long short-term memory neural network of well logging data reconstruction</article-title>. <source>Petroleum Earth Physics Exploration</source> <volume>57</volume> (<issue>06</issue>), <fpage>1473</fpage>&#x2013;<lpage>1480&#x2b;1263</lpage>. <pub-id pub-id-type="doi">10.13810/j.cnki.issn.1000-7210.2022.06.023</pub-id>
</citation>
</ref>
<ref id="B35">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zhou</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Zhao</surname>
<given-names>H. H.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>X. C. Z.</given-names>
</name>
<name>
<surname>Qi</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Lai</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Yi</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2025</year>). <article-title>Missing well logs reconstruction based on cascaded bidi-rectional long short-term memory network</article-title>. <source>Expert Systems with Applications</source> <volume>259</volume>, <fpage>125270</fpage>. <pub-id pub-id-type="doi">10.1016/j.eswa.2024.125270</pub-id>
</citation>
</ref>
</ref-list>
</back>
</article>